
LeetCode(C++版)
chenchenchenchenyi
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
1. 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.思路:广度优先搜索,BFS。借助队列,将树中结点按层压入,循...原创 2018-09-26 10:33:09 · 193 阅读 · 0 评论 -
2. 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", "+", "...原创 2018-09-28 11:05:48 · 277 阅读 · 0 评论