Remove K Digits
- 题目
- 代码块
- 想法
Description
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.
The length of num is less than 10002 and will be ≥ k.
The given num does not contain any leading zero.Example 1:
Input: num = “1432219”, k = 3
Output: “1219”
Explanation: Remove the three digits 4, 3, and 2 to form the new number 1219 which is the smallest.
代码
class Solution {
public:
string removeKdigits(string num, int k) {
string res = "";
int n = num.size(), keep = n - k;
for (char c : num) {
while (k && res.size() && res.back() > c) {
res.pop_back();
--k;
}
res.push_back(c);
}
res.resize(keep);
while (!res.empty() && res[0] == '0') res.erase(res.begin());
return res.empty() ? "0" : res;
}
};
想法
对于要进行的字符串,从前往后,一定是消除前面比后面大的数值,所以可以先建立另一个string保存遍历到的字符,直到另一个string最后字符比下一个遍历的字符大,该字符就是需要消除的字符,而对于开头为0,则是消除,如果最后string为空,那么长度为0.