leetcode
皮卡皮卡皮Rex_
让努力把一切变得更好
展开
-
leetcode——计算逆波兰式(后缀表达式)的值
题干:运算符仅包含"+","-","*“和”/",被操作数可能是整数或其他表达式例如:["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6解:class Solution: def evalRPN(self , tokens ): # write code here stack = []原创 2020-08-31 00:06:23 · 211 阅读 · 0 评论 -
leetcode——求给定二叉树的最小深度
题干:求给定二叉树的最小深度。最小深度是指树的根结点到最近叶子结点的最短路径上结点的数量。class Solution: def run(self , root ): # write code here if root is None: return 0 if root.left is not None and root.right is not None: return min(self.run(r原创 2020-08-30 22:14:14 · 126 阅读 · 0 评论