BIGO计算机视觉一面凉经8.30

from queue import PriorityQueue
class Solution(object):
    def rearrangeString(self, s, k):
        """
        :type s: str
        :type k: int
        :rtype: str
        """
        if k ==0:
            return s
        array = [0 for i in range(256)]
        for x in range(len(s)):
            array[ord(s[x])]+=1

        q = PriorityQueue()
        for i in range(256):
            nums = array[i]
            if nums>0:
                q.put((-nums,i))
        tmp =[]
        result = []
        while not q.empty():

            num,index = q.get()
            result.append(chr(index))
            tmp.append((num+1,index))
            if len(tmp)==k:
                nums,index = tmp[0]
                if nums<0:
                    q.put((nums,index))
                del tmp[0]
        print(result)
        if len(result) ==len(s):
            return "".join(result)
        else:
            return ""
if __name__ =="__main__":
    s = Solution()
    st,k = "aaadbbcc", 2
    print(s.rearrangeString(st,k)