
编程刷题
文章平均质量分 70
CSeUer
这个作者很懒,什么都没留下…
展开
-
最大利益:Maximum Profit(复杂度)
最大利益:Maximum Profit输入:第1行输入整数n,接下来n行一次给出整数原创 2017-08-07 23:20:02 · 1505 阅读 · 0 评论 -
LeetCode:波兰表达式求值(栈)
波兰表达式求值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-08-04 10:53:46 · 560 阅读 · 0 评论 -
LeetCode: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.二叉树根节点到最近叶子节点的距离递归解法:递原创 2017-08-03 22:31:55 · 1063 阅读 · 0 评论