题目:
代码:
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?
思路:
遍历两边,首先每个人得一块糖,第一遍从左到右,若当前点比前一个点高就比前者多一块。
这样保证了在一个方向上满足了要求。第二遍从右往左,若左右两点,左侧高于右侧,但
左侧的糖果数不多于右侧,则左侧糖果数等于右侧糖果数+1,这就保证了另一个方向上满足要求
import java.util.Arrays; public class Solution { public int candy(int[] ratings) { if(ratings == null || ratings.length == 0){ return 0; } int n = ratings.length; int[] candy = new int[n]; int sum=0; Arrays.fill(candy,1); for(int i=1;i<n;i++){ if(ratings[i]>ratings[i-1]){ candy[i] = candy[i-1]+1; } } for(int i=n-1;i>=1;i--){ if(ratings[i-1]>ratings[i] && candy[i-1] <= candy[i]){ candy[i-1 ] = candy[i]+1; } } for(int num:candy){ sum+=num; } return sum; } }