945. Minimum Increment to Make Array Unique
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:
0 <= A.length <= 40000
0 <= A[i] < 40000
题目链接:https://leetcode-cn.com/problems/minimum-increment-to-make-array-unique/
思路
法一:计数
方法比较蠢,对所有数字遍历,计算各自出现次数,记录最大值。然后在 [0,最大值] 做遍历,如果i出现多次,则加入队列等待消除;若没有出现,则可以去消除队列中的数字。
class Solution {
public:
int minIncrementForUnique(vector<int>& A) {
int len = A.size();
if(len<=1) return 0;
map<int,int> nums;
int ma = -1;
for(auto num: A){
++nums[num];
ma = max(ma, num);
}
queue<int> q;
int res = 0;
for(int i=0; i<=ma;++i){
if(!nums.count(i) && !q.empty()){
int tmp = q.front();
q.pop();
res += i - tmp;
}
else if(nums[i]>1){
for(int j=0; j<nums[i]-1; ++j){
q.push(i);
}
}
}
int i = 1;
while(!q.empty()){
res += ma + i - q.front();
q.pop();
++i;
}
return res;
}
};
法二:排序
事实上,可以通过简单样例尝试出,只要重复数字优先去变为大于它的最小值,不管哪个数字做变动,结果都一样。
因此对数组排序,如果当前数字和前一数字一样,则当前数字加一。
class Solution {
public:
int minIncrementForUnique(vector<int>& A) {
int len = A.size();
if(len<=1) return 0;
sort(A.begin(), A.end());
int res = 0;
for(int i=1; i<len; ++i){
if(A[i]<=A[i-1]){
res += (A[i-1] + 1 - A[i]);
A[i] = A[i-1]+1;
}
}
return res;
}
};