题目描述:
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
思路:
对数组元素进行排序,然后将当前元素和它的前一个元素进行比较,当前元素至少应该等于前一个元素+1.
若当前元素比前一个元素大或者和它相等,那么当前元素至少需要在前一个元素的基础上加1.
需要走的步数是当前位置应该的元素-实际元素+1.
实现1:
//这种方法的缺点是改变了数组的元素
private static int fun2(int[] A){
if(A==null||A.length==0){
return 0;
}
int n=A.length;
Arrays.sort(A);
int ret=0;
for(int i=1;i<n;i++){
if(A[i-1]>=A[i]){
int step=A[i-1]-A[i]+1;
A[i]=A[i-1]+1;
ret+=step;
}
}
return ret;
}
实现2:不会改变数组中的元素
public static int fun(int[] nums){
Arrays.sort(nums);
int ret = 0, curr = 0;
for (int item : nums) {
ret += Math.max(curr - item, 0);
curr = Math.max(item, curr) + 1;
}
return ret;
}