leetcode 135

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 Solution {
    public int candy(int[] ratings) {
                int start = 1;
        int initNum = 1;
        int ans = initNum;
        while(start<ratings.length){
            while(start<ratings.length&&ratings[start - 1] == ratings[start]){
                initNum = 1;
                ans += initNum;
                start++;
            }
            boolean find = false;
            int len = 0;
            while(start<ratings.length&&ratings[start - 1]  > ratings[start]){
                initNum --;
                ans += initNum;
                find = true;
                start++;
                len ++;
            }
            if(find){
                if(initNum<=0){
                    ans+=(1-initNum)*(len+1);
                }else{
                    ans -= (initNum-1)*len;
                }
                initNum=1;
            }
            while(start<ratings.length&&ratings[start - 1] < ratings[start]){
                initNum++;
                ans += initNum;
                start++;
            }
            }
        return ans;
    }
}

运行时间

• 3ms