![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【刷题笔记】
QX_a11
认真生活
展开
-
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。给定一棵二叉树,找到它的最小深度。最小深度是沿着从根节点到最近叶节...原创 2019-03-24 12:06:25 · 193 阅读 · 0 评论 -
LeetCode刷题笔记(逆波兰式):evaluate-reverse-polish-notation
题目描述:Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another expression.Some examples: ["2", "1", "+", "3"...原创 2019-03-28 23:23:35 · 224 阅读 · 0 评论