【leetcode】402. Remove K Digits

class Solution(object):
    def getNearbyMin(self,d,val):
        inx = 10002
        for i in range(val):
            i = str(i)
            if i in d and len(d[i]) > 0:
                inx = min(inx,d[i][0])
        return inx
    def removeKdigits(self, num, k):
        """
        :type num: str
        :type k: int
        :rtype: str
        """
        import bisect
        res = ‘‘
        dic = {}
        for i,v in enumerate(num):
            if v not in dic:
                dic[v] = [i]
            else:
                bisect.insort_left(dic[v],i)

        for i, v in enumerate(num):
            nextMinInx = self.getNearbyMin(dic,int(v))
            if (nextMinInx-i) <= k:
                k -= 1
            else:
                res += v
            del dic[v][0]
        if k > 0:
            res = res[:len(res)-k]
            if len(res) == 0:
                res = ‘0‘
        return str(int(res))