LeetCode Candy Greedy

思路：贪心。

• Each child must have at least one candy.
  刚开始，每个孩子都得一个candy。

• Children with a higher rating get more candies than their neighbors.
  从左往右扫描一遍，处理 右孩子比左孩子等级高 的情况；
  再从右往左扫描一遍，处理 左孩子比右孩子等级高 且 左孩子比右孩子candy数少 的情况；

class Solution {
public:
    int candy(vector<int>& ratings) {
        int len = ratings.size();
        if(len == 0) {
            return 0;
        }
        if(len == 1) {
            return 1;
        }
        int min_sum = 0;
        vector<int> res(len, 1);
        //from left to right
        for(int i = 0; i <= len - 2; ++i) {
            if(ratings[i + 1] > ratings[i]) {
                res[i + 1] = res[i] + 1;
            }
        }
        //from right to left
        for(int i = len - 1; i >= 1; --i) {
            if(ratings[i - 1] > ratings[i] && res[i - 1] <= res[i]) {
                res[i - 1] = res[i] + 1;
            }
        }
        //sum
        for(int i = 0; i < len; ++i) {
            min_sum += res[i];
        }
        return min_sum;
    }
};

java code:

public class Solution {
    public int candy(int[] ratings) {
        int len = ratings.length;
        int[] res = new int[len];
        Arrays.fill(res, 1);

        // from left to right
        for(int i = 0; i <= len - 2; ++i) {
            if(ratings[i + 1] > ratings[i]) {
                res[i + 1] = res[i] + 1;
            }
        }

        // from right to left
        for(int i = len - 1; i >= 1; --i) {
            if(ratings[i - 1] > ratings[i] && res[i - 1] <= res[i]) {
                res[i - 1] = res[i] + 1;
            }
        }

        int sum = 0;
        for(int i = 0; i < len; ++i) {
            sum += res[i];
        }

        return sum;
    }
}