Candy
Desicription
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?
Example 1:
1 2 3
 Input: [1,0,2] Output: 5 Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.

Example 2:
1 2 3 4
 Input: [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.

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