2021-04-06 算法打卡第三周 计算器与每日温度

第一题：
面试题 16.26. 计算器 https://leetcode-cn.com/problems/calculator-lcci/ 

class Solution:
    def calculate(self, s: str) -> int:
        s = s.replace(" ", '')
        stack_num, stack_op = [], []
        num_tmp = 0
        for i in range(len(s)):
            if s[i] in '+-*/':
                stack_op.append(s[i])
                
            else:
                num_tmp = num_tmp * 10 + int(s[i])
                if i == len(s) - 1 or s[i + 1] in '+-/*':
                    stack_num.append(num_tmp)
                    num_tmp = 0
                    if stack_op and stack_op[-1] in '*/':
                        op = stack_op.pop()
                        n2, n1 = stack_num.pop(), stack_num.pop()
                        stack_num.append(n1 * n2 if op == "*" else n1 // n2)
        res = stack_num.pop(0)
        while stack_op:
            op, n = stack_op.pop(0), stack_num.pop(0)
            res = res + n if op == '+' else res - n
        return res

 

第二题：739. 每日温度 https://leetcode-cn.com/problems/daily-temperatures/

这道题开始做的时候用了两层for循环，结果提交的时候果不其然的超时了，随后在题解里面找到了单调栈解题的思路

class Solution:
    def dailyTemperatures(self, T: List[int]) -> List[int]:
        res = [0] * len(T)
        stack = []
        for i in range(len(T) - 1, -1, -1):
            while stack and T[i] >= T[stack[-1]]:
                stack.pop()
            res[i] = 0 if not stack else stack[-1] - i
            stack.append(i)
        return res

这里面看似是两层的for循环，但由于每条数据只有一次进栈和出栈，所以时间复杂度还是O(n)而不是O(n2)