forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
_135.java
43 lines (34 loc) · 1.01 KB
/
_135.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
package com.fishercoder.solutions;
/**
* 135. Candy
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?
*/
public class _135 {
public static class Solution1 {
public int candy(int[] ratings) {
int[] candy = new int[ratings.length];
for (int i = 0; i < ratings.length; i++) {
candy[i] = 1;
}
for (int i = 0; i < ratings.length - 1; i++) {
if (ratings[i] < ratings[i + 1]) {
candy[i + 1] = candy[i] + 1;
}
}
for (int i = ratings.length - 1; i > 0; i--) {
if (ratings[i] < ratings[i - 1]) {
candy[i - 1] = Math.max(candy[i - 1], candy[i] + 1);
}
}
int sum = 0;
for (int i : candy) {
sum += i;
}
return sum;
}
}
}