2019年10月28日
力扣算法题—150. Evaluate Reverse Polish Notation
摘要： Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another e 阅读全文
posted @ 2019-10-28 23:28 自由之翼Az 阅读(172) 评论(0) 推荐(0)
力扣算法题—111.Minimum Depth of Binary Tree
摘要： Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2019-10-28 23:08 自由之翼Az 阅读(159) 评论(0) 推荐(0)