1.题目描述
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.
Note:
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.
Example 2:
Input: num = "10200", k = 1
Output: "200"
Explanation: Remove the leading 1 and the number is 200. Note that the output must not contain leading zeroes.
2.代码
分析:本题的贪心策略体现在,如果当前字符数值比栈顶字符数值小,不断弹出栈顶数值直到不再小于当前字符为止,同时统计删除的字符数。因此,需要弹出栈顶字符当且仅当遇到比栈顶字符小的字符,否则统统入栈,最后再根据应得到的结果大小,剔除多余的尾补子串。
算法正确性:算法的正确性在于,每次向前看去剔除已入栈的元素时,是在保证了剔除数不超过给定 k 的情况下,当第一个while 结束时,我们已经把这样的一些子串全部剔除(即字符数值是递减的子串),得到的是非严格递增的子串,对于这个非严格递增的子串,在保证删除总数 k <script type="math/tex" id="MathJax-Element-9">k</script>的情况下,只有从尾部删除才能使之更小,较之中部删除,显然得到的子串是要比删除尾部元素的要大!
class Solution {
public:
string removeKdigits(string num, int k) {
if(num.size() == k) return "0";
int del = 0;
int i = 0;
string res = "";
for(; i < num.length(); ++i) {
while(res.length() && res.back() > num[i] && k) {
res.pop_back();
k--;
}
if(res.length() || num[i] != '0') {
res.push_back(num[i]);
}
}
while(res.length() && k--){
res.pop_back();
}
return res.empty() ? "0" : res;
}
};