LeetCode OJ - 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?

貌似很多题都是两边扫描啊，或者多编

int candy(vector<int> &ratings) {
    if(ratings.empty()) return 0;
    vector<int> candy(ratings.size(), 1);

    for(int i = 0; i < ratings.size() - 1; i++) {
        if(ratings[i] < ratings[i + 1])  candy[i + 1] = candy[i] + 1;
    }

    for(int i = ratings.size() - 2; i > 0; i--) {
        if(ratings[i] > ratings[i + 1] && candy[i] < candy[i + 1] + 1)
            candy[i] = candy[i + 1] + 1;   
    }
    int ret = 0;
    for(int i = 0; i < candy.size(); i++) {
        ret += candy[i];
    }

    return ret;
}