739. Daily Temperatures -M

Given a list of daily temperatures T, return a list such 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 of temperatures T = [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].

A:

就是一个数组，找到其后比他高的数字里最近的那个。
思路是：保持一个increasing list, 然后每次

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& T) {
        int n = T.size();
        vector<int> res(n, 0);
        list<pair<int, int> > mylist; // save <temperator, index>, the list should be increasing order
        for(int i = T.size()-1; i>=0;--i)
        {    // first find next warmer index
            for(auto iter = mylist.begin(); iter != mylist.end(); ++iter)
            {
                if(iter->first<= T[i])
                {
                    iter = mylist.erase(iter);
                    --iter; // re-visit this value
                }else{
                    res[i] = iter->second - i;
                    break;
                }
            }
            // now insert current value
            mylist.push_front(make_pair(T[i], i));
        }
        return res;
    }
};