forked from mengli/leetcode
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCandy.java
More file actions
Latest commit
28 lines (26 loc) · 841 Bytes
/
Copy pathCandy.java
File metadata and controls
28 lines (26 loc) · 841 Bytes
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
/**
* 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:
*
* Each child must have at least one candy. Children with a higher rating get
* more candies than their neighbors.
*
* What is the minimum candies you must give?
*
*/
publicclassCandy {
publicintcandy(int[] ratings) {
int[] candy = newint[ratings.length];
candy[0] = 1;
for (inti = 1; i < ratings.length; i++) {
candy[i] = ratings[i] > ratings[i - 1] ? candy[i - 1] + 1 : 1;
}
inttotalCandy = candy[ratings.length - 1];
for (inti = 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];
}
returntotalCandy;
}
}