-
Notifications
You must be signed in to change notification settings - Fork 121
/
Copy pathCandy.java
27 lines (27 loc) · 902 Bytes
/
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
/**
* There are N children standing in a line. Each child is assigned a rating value. You are giving
* candies to these children subjected to the following requirements:
*
* <p>Each child must have at least one candy. Children with a higher rating get more candies than
* their neighbors.
*
* <p>What is the minimum candies you must give?
*/
public class Candy {
public int candy(int[] ratings) {
int[] candy = new int[ratings.length];
candy[0] = 1;
for (int i = 1; i < ratings.length; i++) {
candy[i] = ratings[i] > ratings[i - 1] ? candy[i - 1] + 1 : 1;
}
int totalCandy = candy[ratings.length - 1];
for (int i = ratings.length - 2; i >= 0; i--) {
candy[i] =
(ratings[i] > ratings[i + 1] && candy[i + 1] + 1 > candy[i])
? candy[i + 1] + 1
: candy[i];
totalCandy += candy[i];
}
return totalCandy;
}
}