开发者社区云计算文章正文

[LeetCode] Candy

2015-07-27 808

版权

本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。

简介： Well, you may need to run some examples to have the intuition for the answer since we only require children with higher rating get more candies than their neighbors, not all those with lower ratings.

Well, you may need to run some examples to have the intuition for the answer since we only require children with higher rating get more candies than their neighbors, not all those with lower ratings.

The following code is taken from this link. It involves two-pass scan to ensure the above condition. You will get it after running some examples, like modifying the code and check the wrong cases :-)

 1 class Solution {
 2 public:
 3     int candy(vector<int>& ratings) {
 4         int n = ratings.size();
 5         vector<int> candies(n, 1);
 6         for (int i = 1; i < n; i++)
 7             if (ratings[i] > ratings[i - 1])
 8                 candies[i] = candies[i - 1] + 1;
 9         for (int i = n - 1; i > 0; i--)
10             if (ratings[i - 1] > ratings[i])
11                 candies[i - 1] = max(candies[i - 1], candies[i] + 1);
12         int total = 0;
13         for (int i = 0; i < n; i++)
14             total += candies[i];
15         return total;
16     }
17 };