[leetcode] 945. Minimum Increment to Make Array Unique

Description

Given an array of integers A, a move consists of choosing any A[i], and incrementing it by 1.

Return the least number of moves to make every value in A unique.

Example 1:

Input: [1,2,2]
Output: 1
Explanation:  After 1 move, the array could be [1, 2, 3].

Example 2:

Input: [3,2,1,2,1,7]
Output: 6
Explanation:  After 6 moves, the array could be [3, 4, 1, 2, 5, 7].
It can be shown with 5 or less moves that it is impossible for the array to have all unique values.

Note:

1. 0 <= A.length <= 40000.
2. 0 <= A[i] < 40000.

分析

题目的意思是：把一个数组里面的一些数数增加若干个1，使得最后数组里面的数都唯一。
思路我也没想出来，估计是坏掉了。首先是统计数的个数，然后再记录重复的数，放到taken里面，最后从0～100000中遍历找到未出现在数组里面的数来放到数组中，放进去的同时taken里面的数也要相应的减1，直到taken里面没有数，且遍历完为止。思路

代码

class Solution:
    def minIncrementForUnique(self, A: List[int]) -> int:
        count=collections.Counter(A)
        taken=[]
        
        res=0
        for x in range(100000):
            if(count[x]>1):
                taken.extend([x]*(count[x]-1))
            elif(taken and count[x]==0):
                res+=x-taken.pop()
        return res

参考文献

[LeetCode] Approach 1: Counting