/
Candy.java
52 lines (42 loc) · 1.59 KB
/
Candy.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
// https://leetcode.com/problems/candy
class Solution {
public int candy(int[] ratings) {
int n = ratings.length, sum = 0;
Data[] dataset = new Data[n];
int[] candies = new int[n];
for (int i = 0; i < n; i++) {
dataset[i] = new Data(ratings[i], i);
}
Arrays.sort(dataset);
for (int i = 0; i < n; i++) {
int minIndex = dataset[i].index;
int pLeft = safeAccess(ratings, minIndex - 1);
int pRight = safeAccess(ratings, minIndex + 1);
int p = ratings[minIndex];
if (p <= pLeft && p <= pRight) {
candies[minIndex] = 1;
} else if(p > pRight && p > pLeft) {
candies[minIndex] = Math.max(candies[minIndex + 1], candies[minIndex - 1]) + 1;
} else if (p > pRight) {
candies[minIndex] = candies[minIndex + 1] + 1;
} else if (p > pLeft) {
candies[minIndex] = candies[minIndex - 1] + 1;
}
sum += candies[minIndex];
}
return sum;
}
int safeAccess(int[] arr, int i) {
return i < 0 || i >= arr.length ? Integer.MAX_VALUE : arr[i];
}
class Data implements Comparable<Data> {
int val, index;
Data(int val, int index) {
this.val = val;
this.index = index;
}
public int compareTo(Data other) {
return this.val == other.val ? this.index - other.index : this.val - other.val;
}
}
}