LeetCode-739. Daily Temperatures

最新推荐文章于 2020-05-28 17:10:37 发布

Burette_Lee

最新推荐文章于 2020-05-28 17:10:37 发布

阅读量185

点赞数

分类专栏： LeetCode-C++ C/C++ 文章标签： LeetCode stack

本文链接：https://blog.csdn.net/qq_29303759/article/details/81457297

版权

LeetCode-C++ 同时被 2 个专栏收录

35 篇文章 0 订阅

订阅专栏

C/C++

25 篇文章 0 订阅

订阅专栏

Given a list of daily temperatures, produce a list that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.

For example, given the list temperatures = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].

题目：给定一格温度列表，求对于每一天，还需要等待多少天比当天温度更高。返回vector

思路：看到题目就想着利用循环挨个找就得了，对第i天，从i+1开始查找，如果高于i天的就记录下来并且停止循环，再依次看i+1天的。

代码：

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& temperatures) {
        vector<int> ret;
		int size = temperatures.size();
        for(int i=0;i<size;i++){
        	int j;
        	for(j=i+1;j<size;j++){
        		if(temperatures[j]>temperatures[i]){
        			ret.push_back(j-i);
        			break;
				}
				if(j==size-1)
					ret.push_back(0);
			}
		}
    	ret.push_back(0);
		return ret;
    }
};

emmmmm,是能过的，只是才beats 2%￣へ￣