leetcode 138: Candy (incompleted)

最新推荐文章于 2024-04-13 22:51:37 发布

xudli

最新推荐文章于 2024-04-13 22:51:37 发布

阅读量883

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/17234243

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Candy

Total Accepted: 3585 Total Submissions: 22902

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?

wrong answer:

class Solution {
public:
    int candy(vector<int> &ratings) {
        if(ratings.size()<1) return 0;
        if(ratings.size()<2) return 1;
        
        int sum = 1;
        int pre = 1;
        int min = 1;
        for(int i=1; i<ratings.size(); i++) {
            int cur;
            if(ratings[i]<ratings[i-1]) {
                cur = pre -1;
            } else if(ratings[i]>ratings[i-1]) {
                cur = pre + 1;
            } else {
                cur = 1;
            }
            min = min<cur ? min : cur;
            sum += cur;
            pre = cur;
        }
        return sum + (1-min)*ratings.size();
    }
};