Candy

最新推荐文章于 2024-09-18 07:45:00 发布

排山和倒海

最新推荐文章于 2024-09-18 07:45:00 发布

阅读量506

点赞数

分类专栏：算法文章标签：算法 leetcode

本文链接：https://blog.csdn.net/wangqing008/article/details/27189089

版权

算法专栏收录该内容

23 篇文章 0 订阅

订阅专栏

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?

首先用的是，类似DP的方法，一个一个元素进行查询，当发现这个元素比上一个元素的rating要小时，回溯计算前面rating比当前rating要小的所有值。

但是我写的超时了。

class Solution {
public:
    int candy(vector<int> &ratings) {

		if(ratings.size()<=1){
			return ratings[0];
		}
		int length = ratings.size();
		int * candy = new int[length]; 
		int i = 0;
		for(i = 0;i<length;i++){
			candy[i] = 1;
		}
		for(int i = 1;i<length;i++){
			if(i==length-1){
				if(ratings[i]>ratings[i-1]){
					candy[i] = candy[i-1]+1;
				}
				continue;
			}
			if(ratings[i]>ratings[i+1]&&ratings[i]>ratings[i-1]){
				candy[i] = max(candy[i-1],candy[i+1])+1;
			}
			else if(ratings[i]<ratings[i-1]&&ratings[i]>ratings[i+1]){
				candy[i] = candy[i+1]+1;
				DP(candy,i-1,ratings);
			}
			else if(ratings[i]>ratings[i-1]&&ratings[i]<ratings[i+1]){
				candy[i] = candy[i-1]+1;
			}
		}
		for(i=1;i<length;i++){
			candy[i]+=candy[i-1];
		}
		return candy[length-1];
    }
	void DP(int data[],int index,vector<int> &ratings){
		if(index == 0){
			if(ratings[index]>ratings[index+1]&&data[index]<=data[index+1]){
				data[index] = data[index+1]+1;
			}
			return ;
		}
		data[index] = data[index+1]+1;
		if(ratings[index-1]>ratings[index]){
			DP(data,index-1,ratings);
		}
	}
};

有一个很巧妙的方法，我是从其他人那里看到的，非常好的算法。

主要原理是，先从头到尾扫一遍，比前一个值rating大的，就增加，然后从尾到头再扫一遍，如果比后一个值rating大，就增加。

当然我写的太过直白，有很多地方的循环是可以省掉的。

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