算法：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个数得到一个最小的数，就是让高位的数字尽可能小，遍历数字，如果当前的数字比前面的数字小那么就换掉前面的数字，相当于移除一个数字，这种操作最多进行k次，如果k变为0，并且新序列长度达到n-k，那么就可以终止遍历了。最后还要除去前面的0。

代码

class Solution {
public:
    string removeKdigits(string num, int k) {
        int ans_len = num.length() - k;
        char* ans=new char[ans_len];
        int top = 0;

        for (int i = 0; i < num.length(); ++i) {
            char c = num[i];
            while (top > 0 && ans[top-1] > c && k > 0) {
                top--; k--;
            }
            ans[top++] = c;
            //跳出遍历
            if(k==0 && top== ans_len)
               break;
        }
        //去除前面的零
        int temp = 0;
        while (temp < ans_len && ans[temp] == '0') 
              temp++;
        if(temp==ans_len)
        return "0";
        else
        {
            string t= string(ans, temp, ans_len - temp);
            return t;
        }


    }
};