题目:
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?
实现代码:
class Solution {
public:
int candy(vector<int> &ratings) {
int res = 0;
//孩子总数
int n = ratings.size();
//糖果集合
vector<int> candy(n, 1);
//从左往右遍历
for (int i = 0;i < n - 1;i++)
{
if (ratings[i + 1] > ratings[i])
candy[i + 1] = candy[i] + 1;
}
//从右往左
for (int i = n - 1;i > 0;i--)
{
if (ratings[i - 1] > ratings[i] && candy[i - 1] <= candy[i])
candy[i - 1] = candy[i] + 1;
}
//累加结果
for (auto a : candy) //for(int i=0; i<n; i++) res += candy[i];
{
res += a;
}
return res;
}
};
补充知识点:c++中 for(auto i : v)的:是什么意思???
这是c++11的新特性,范围for。v是一个可遍历的容器或流,比如vector类型,i就用来在遍历过程中获得容器里的每一个元素.
例如:vector<int> v={1,2,3,4};
for(auto i:v)
cout<<i;
结果就是1234
解题思路:
遍历两边,首先每个人得一块糖,第一遍从左到右,若当前点比前一个点高就比前者多一块。这样保证了在一个方向上满足了要求。
第二遍从右往左,若左右两点,左侧高于右侧,但左侧的糖果数不多于右侧,则左侧糖果数等于右侧糖果数+1,这就保证了另一个方向上满足要求。
最后将各个位置的糖果数累加起来就可以了。