[LeetCode] 发糖果 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?

一个错误的方法是，把孩子们的rating值由小到大排序，按排序的序号发糖果，序号小，发糖果也少，序号大，发糖果多，如果相邻的两个序号的rating一样，发的糖果也应该一样。代码如下：

int candy(vector<int> &ratings) {

	vector<int> idx;
	idx.push_back(0);

	// sort the ratings and obtain the sorted indices
	for(int i=1; i<ratings.size(); i++)
	{
		int j;
		int tmp = ratings[i];
		idx.push_back(i);

		for(j=i-1; j>=0; j--)
		{
			if(ratings[j]>tmp)
			idx[j+1] = idx[j];
		}
		idx[j+1] = i;
	}

	int candyNum = 0; // the number of candies given to the current child
	int totalCandyNum = 0; // total number of candies 
	for(int i=0; i<ratings.size(); i++)
	{
		if(i==0)
		{
			candyNum = 1; // 1 candy is given to the first child
		}

		if(i>0)
			if(ratings[idx[i]]>ratings[idx[i-1]])
				candyNum += 1; // only when rating is bigger will he/she be given 1 one candy

		totalCandyNum += candyNum;        
	}

	return totalCandyNum;
}

上面的方法的failure case是 ratings = { 3,2,3,1}. 按照上面的方法，第2个小孩得到的candy是2，但是其实给他1个就行了。

下面是正确的解法：

Scan the rating array from left to right and then from right to left. In every scan just consider the rising order (l->r: r[i]>r[i-1] or r->l: r[i]>r[i+1]), assign +1 candies to the rising position.
The final candy array is the maximum (max(right[i],left[i])) in each position.
The total candies is the sum of the final candy array.

代码：

class Solution {
public:
    int getC(vector<int> &r){
        vector<int> lc(r.size(),1);
        vector<int> rc(r.size(),1);
        int res=0;
        for (int i=1;i<lc.size();i++){
            if (r[i]>r[i-1]){
                lc[i]=lc[i-1]+1;
            }
        }
        for (int i=rc.size()-2;i>=0;i--){
            if (r[i]>r[i+1]){
                rc[i]=rc[i+1]+1;
            }
        }
        for (int i=0;i<r.size();i++){
            res+=max(lc[i],rc[i]);
        }
        return res;
    }
     
    int candy(vector<int> &ratings) {
        return getC(ratings);
    }
};