LeetCode-135. Candy [C++][Java]

LeetCode-135. Candyhttps://leetcode.com/problems/candy/

题目描述

There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.

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.

Return the minimum number of candies you need to have to distribute the candies to the children.

Example 1:

Input: ratings = [1,0,2]
Output: 5
Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.

Example 2:

Input: ratings = [1,2,2]
Output: 4
Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
The third child gets 1 candy because it satisfies the above two conditions.

Constraints:

• n == ratings.length
• 1 <= n <= 2 * 10^4
• 0 <= ratings[i] <= 2 * 10^4

解题思路

【C++】

class Solution {
public:
    int candy(vector<int>& ratings) {
        int size = ratings.size();
        if (size < 2) {return size;}
        vector<int> num(size, 1);
        for (int i = 1; i < size; ++i) {
            if (ratings[i] > ratings[i-1]) {
                num[i] = num[i-1] + 1;
            }
        }
        for (int i = size - 1; i > 0; --i) {
            if (ratings[i] < ratings[i-1]) {
                num[i-1] = max(num[i-1], num[i] + 1);
            }
        }
        int sum = 0;
        for (int i = 0; i < size; i++) {sum += num[i];}
        return sum;
    }
};

【Java】

class Solution {
    public int candy(int[] ratings) {
        int size = ratings.length;
        if (size < 2) {return size;}
        int[] num = new int[size];
        Arrays.fill(num, 1);
        for (int i = 1; i < size; ++i) {
            if (ratings[i] > ratings[i-1]) {
                num[i] = num[i-1] + 1;
            }
        }
        for (int i = size - 1; i > 0; --i) {
            if (ratings[i] < ratings[i-1]) {
                num[i-1] = Math.max(num[i-1], num[i] + 1);
            }
        }
        int sum = 0;
        for (int i = 0; i < size; i++) {sum += num[i];}
        return sum;
    }
}

参考文献

【1】java 数组初始化为-1,如何在Java中将数组的所有元素初始化为任何特定值