leetcode-1481-不同整数的最少数目

提交:

class Solution:
    def findLeastNumOfUniqueInts(self, arr: List[int], k: int) -> int:
        count = collections.Counter(arr)
        order_dic = sorted(count.items(),key=lambda item:item[1])
        n = len(order_dic)
        for i,v in order_dic:
            if v > k:
                break
            else:
                k -= v
                n -= 1
        return n
        

猜你喜欢

转载自www.cnblogs.com/oldby/p/13166783.html