[LeetCode] 402. Remove K-digits @ python

一．题目：
给一个用字符串表示的数字，移除字符串中的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.

二．解题思路：
我们需要建立一个单调递增栈，然后遍历整个字符串，从左到右将数字压入栈中，同时比较栈顶元素与当前元素大小．代码如下：

class Solution(object):
    def removeKdigits(self, num, k):
        """
        :type num: str
        :type k: int
        :rtype: str
        """
        if len(num) == k:
            return '0'
        stack = []
        for n in num:
            while stack and k and int(stack[-1]) > int(n):
                stack.pop()
                k -= 1
            stack.append(n)
            
        while k:
            stack.pop()
            k -= 1
        return str(int("".join(stack)))