[Undone]Explore00_Stack_Daily Temperatures_Chapter03

[zwkcoding]

Question: Problem see here : https://leetcode.com/explore/learn/card/queue-stack/230/usage-stack/1363/

leave the hole: use the Data Structure Stack,

initial ideas:

• process from last day to first day
• last day's future warmer day is 0, for the second last, only to consider the near last day. And so on

[zwkcoding]

Solution:

/// Time Complexity: O(n)
/// Space Complexity: O(n)
class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& T) {
        stack<int> sta;
        vector<int> ans;
        ans.resize(T.size(), 0);
        for(int i=0;i<T.size();i++){
            while(sta.empty() != true) {
                if(T[sta.top()] < T[i])  {
                    ans[sta.top()] = i - sta.top();
                    sta.pop();
                } else {
                    break;
                }
            }
            sta.push(i);
        }
        return ans;
    }

};