-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
945.java
57 lines (50 loc) · 1.66 KB
/
945.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
__________________________________________________________________________________________________
sample 3 ms submission
class Solution {
public int minIncrementForUnique(int[] A) {
int[] dp = new int[40002];
for (int a : A) dp[a]++;
int sum=0;
for (int i = 0; i < dp.length - 1; i++){
if (dp[i] > 1) {
sum += dp[i] - 1;
dp[i+1] += dp[i] - 1;
}
}
if (dp[40001] > 1) {
sum += (dp[40001] - 1) * dp[40001] / 2;
}
return sum;
}
}
__________________________________________________________________________________________________
sample 46736 kb submission
class Solution {
public int minIncrementForUnique(int[] A) {
if (A.length < 2)
return 0;
Arrays.sort(A);
Set<Integer> set = new HashSet<>();
Deque<Integer> dup = new ArrayDeque<>();
int res = 0;
for (int i = 0; i < A.length; i++) {
if (set.contains(A[i])) {
dup.add(A[i]);
} else {
set.add(A[i]);
if (i == 0 || A[i - 1] + 1 == A[i])
continue;
for (int j = A[i - 1] + 1; j < A[i] && !dup.isEmpty(); j++) {
res += (j - dup.poll());
}
}
}
int last = A[A.length - 1] + 1;
while (!dup.isEmpty()) {
res += (last - dup.poll());
last++;
}
return res;
}
}
__________________________________________________________________________________________________