【LeetCode】 945. Minimum Increment to Make Array Unique 使数组唯一的最小增量(Medium)(JAVA)
题目地址: https://leetcode.com/problems/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
题目大意
给定整数数组 A,每次 move 操作将会选择任意 A[i],并将其递增 1。
返回使 A 中的每个值都是唯一的最少操作次数。
解题方法
1、采用排序法,先排序
2、再计算需要移动的数目
class Solution {
public int minIncrementForUnique(int[] A) {
Arrays.sort(A);
int res = 0;
for (int i = 1; i < A.length; i++) {
if (A[i] > A[i - 1]) continue;
res += A[i - 1] - A[i] + 1;
A[i] = A[i - 1] + 1;
}
return res;
}
}
执行用时 : 20 ms, 在所有 Java 提交中击败了 67.40% 的用户
内存消耗 : 46.4 MB, 在所有 Java 提交中击败了 84.31% 的用户