g3101_3200.s3174_clear_digits.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
3174\. Clear Digits
Easy
You are given a string `s`.
Your task is to remove **all** digits by doing this operation repeatedly:
* Delete the _first_ digit and the **closest** **non-digit** character to its _left_.
Return the resulting string after removing all digits.
**Example 1:**
**Input:** s = "abc"
**Output:** "abc"
**Explanation:**
There is no digit in the string.
**Example 2:**
**Input:** s = "cb34"
**Output:** ""
**Explanation:**
First, we apply the operation on `s[2]`, and `s` becomes `"c4"`.
Then we apply the operation on `s[1]`, and `s` becomes `""`.
**Constraints:**
* `1 <= s.length <= 100`
* `s` consists only of lowercase English letters and digits.
* The input is generated such that it is possible to delete all digits.
© 2015 - 2024 Weber Informatics LLC | Privacy Policy