> For the complete documentation index, see [llms.txt](https://nataliekung.gitbook.io/ladder_code/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://nataliekung.gitbook.io/ladder_code/monotonic-queue-stack/daily-temperatures.md).

# Daily Temperatures

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

分析

单调递增，遇到大的，弹出前面小的，并且存储小的结果

stack里存的是Index

```
class Solution:
    def isValid(self, s: str) -> bool:
        left ='([{'
        right = ')]}'
        stack = []
        for i in s:
            if i in left:
                stack.append(i)
            elif i in right:
                if not stack or left.find(stack[-1]) != right.find(i):
                    return False
                stack.pop()
        return True if not stack else False
                
                    
                
        
```