lintcode693. 移掉K位数字

给定一个以字符串表示的非负整数 num，移除这个数中的 k 位数字，使得剩下的数字最小。

样例
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.
注意事项
The length of num is less than 10002 and will be ≥ k.
The given num does not contain any leading zero.

思路：从前往后不比第一个数小的最大的数字，并删除。如果删除后，整个数字前面以0开头，则需要将前面的所有0去掉。

class Solution {
public:
    /**
     * @param num: a number
     * @param k: the k digits
     * @return: the smallest number
     */
    string removeKdigits(string &num, int k) {
        // write your code here.
       while(k)
       {
           int i=0;
           while(i+1<num.size()&&num[i]<=num[i+1]) i++;
           num.erase(num.begin()+i);
           k--;
       }
       while(num[0]=='0') num.erase(num.begin());//移除前导0
       if(num=="") return "0";
       return num;
    }
};