739. Daily Temperatures

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].

方法1：用栈，利用一个小窍门，如果i后面的i+m个元素是第一个比i大的，那么i+m位置的元素比i和i+m中间的元素都大

栈中存元素下标，先push 0，从1遍历到n-1，将当前元素大小与栈顶端元素代表位置处的元素比较，如果大就pop，并且只要栈不空就一直比较下去，直到栈空或者不大于栈顶端元素代表位置处的元素时结束，将当前元素下标push到栈中。

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& temperatures) {
        int n=temperatures.size();
        vector<int> res(n,0);
        if(n==0) return res;
        stack<int> st;
        st.push(0);
        for(int i=1;i<temperatures.size();i++){
            while(!st.empty()){
                if(temperatures[i]>temperatures[st.top()]){
                    res[st.top()]=i-st.top();
                    st.pop();
                }else{
                    break;
                }
            }
            st.push(i);
        }
        return res;
    }
};

方法2：暴力求解，会超时。遍历的时候我用了两个指针从头和尾向中间同时遍历，通过了，但是时间复杂度很高。

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