Easy python solution
\nclass Solution(object):\n    def removeKdigits(self, num, k):\n        """\n        :type num: str\n        :type k: int\n        :rtype: str\n        """\n  
```\nclass Solution(object):\n    def removeKdigits(self, num, k):\n        """\n        :type num: str\n        :type k: int\n        :rtype: str\n        """\n        while k > 0:\n            k -= 1\n            i = 0\n            while i < len(num)-1:\n                if num[i] > num[i+1]:\n                    break\n                i += 1\n            num = num[:i] + num[i+1:]\n        \n        if len(num) == 0:\n            return "0"\n        else:\n            return str(int(num))\n```\nfind the first pair where num[i] > num[i+1], remove num[i]\nif cannot find, remove num[-1]\ndone.
[]