402. Remove K Digits

402. Remove K Digits
     Medium

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.

class Solution {
public:
    string removeKdigits(string num, int k) {
        if(k>=num.length()) return "0";
        vector<char>res;//用向量模拟栈
        int index=0,n=num.size();
        while(index<n)
        {
            if(num[index]!='0'||res.size())//当栈空且当前字符为'0'时，不能进栈，否则可进
                res.push_back(num[index]);
            index++;
            while(k&&res.size()&&num[index]<res[res.size()-1])
            {//删掉较大的高位数
                res.pop_back();
                k--;
            }
        }
        while(k--) res.pop_back();//栈内的字符非单调递减，删低位数
        if(!res.size()) return "0";
        string ans="";
        for(int i=0;i<res.size();i++) ans+=res[i];
        return ans;
    }
};