402. Remove K Digits

402. Remove K Digits

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.

Example 3:

Input: num = "10", k = 2
Output: "0"
Explanation: Remove all the digits from the number and it is left with nothing which is 0.

题目大意

去除字符串的k个字符使去除之后的数字最小，若没有数字，则为0，并去除结果中的前导0.

思路

也算是贪心思想吧，尽量把小的数字往前放，最好的结果是数字从前往后一直递增，这样就是最小的。我们可以在遍历字符串时，若s[i]<s[i-1]，那么就将s[i]删除，若删除后s[i]依然比前一位数字大，则继续删除前一位，直到已经删完k位数字，或者已经遍历到字符串的末尾了。如果此时已经遍历完，但未删除k位数字，则取前length-k位数字即可，因为是递增的。需要注意的是，要去掉结果中的前导0.

代码

class Solution {
    public String removeKdigits(String num, int k) {
        StringBuilder res = new StringBuilder();
        int remain = num.length() - k;
        for(int i = 0; i < num.length(); i++){
            while(k>0 && res.length() != 0 && res.charAt(res.length() - 1) - num.charAt(i) > 0){
                res.deleteCharAt(res.length() - 1);
                k--;
            }
            res.append(num.charAt(i));
        }
        String tmp = res.substring(0, remain).toString();
        String ans = "";
        boolean isprevzero = false;
        for(int i = 0; i < tmp.length(); i++){
            if(!isprevzero && tmp.charAt(i) != '0'){
                isprevzero = true;
            }
            if(isprevzero){
                ans += tmp.charAt(i);
            }
        }
        if(ans.length() == 0) return "0";
        return ans.toString();
    }
}