TheRealSamuel/LeetCodeProblem
0564
1{2 "id": 2470,3 "name": "removing_stars_from_a_string",4 "difficulty": "Medium",5 "link": "https://leetcode.com/problems/removing-stars-from-a-string/",6 "date": "1661040000000",7 "task_description": "You are given a string `s`, which contains stars `*`. In one operation, you can: Choose a star in `s`. Remove the closest **non-star** character to its **left**, as well as remove the star itself. Return _the string after **all** stars have been removed_. **Note:** The input will be generated such that the operation is always possible. It can be shown that the resulting string will always be unique. **Example 1:** ``` **Input:** s = \"leet**cod*e\" **Output:** \"lecoe\" **Explanation:** Performing the removals from left to right: - The closest character to the 1st star is 't' in \"lee**t****cod*e\". s becomes \"lee*cod*e\". - The closest character to the 2nd star is 'e' in \"le**e***cod*e\". s becomes \"lecod*e\". - The closest character to the 3rd star is 'd' in \"leco**d***e\". s becomes \"lecoe\". There are no more stars, so we return \"lecoe\". ``` **Example 2:** ``` **Input:** s = \"erase*****\" **Output:** \"\" **Explanation:** The entire string is removed, so we return an empty string. ``` **Constraints:** `1 <= s.length <= 105` `s` consists of lowercase English letters and stars `*`. The operation above can be performed on `s`.",8 "public_test_cases": [9 {10 "label": "Example 1",11 "input": "s = \"leet**cod*e\"",12 "output": "\"lecoe\" "13 },14 {15 "label": "Example 2",16 "input": "s = \"erase*****\"",17 "output": "\"\" "18 }19 ],20 "private_test_cases": [],21 "haskell_template": "removeStars :: String -> String\nremoveStars s ",22 "ocaml_template": "let removeStars (s: string) : string = ",23 "scala_template": "def removeStars(s: String): String = { \n \n}",24 "java_template": "public static String removeStars(String s) {\n\n}",25 "python_template": "class Solution(object):\n def removeStars(self, s):\n \"\"\"\n :type s: str\n :rtype: str\n \"\"\"\n "26}