![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
题目类一一leetcode经典
ad50468549
这个作者很懒,什么都没留下…
展开
-
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 leaf node.class Solution { public: int run(原创 2017-05-03 21:27:58 · 199 阅读 · 0 评论 -
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 expression. Some examples: [“2”, “1”, “+”, “3”,原创 2017-05-04 20:13:08 · 198 阅读 · 0 评论