C++
L丶K丶
这个作者很懒,什么都没留下…
展开
-
[LeetCode] [C++] 62. Unique Paths
There are numbers in each grid in the picture, which stand for the number of unique paths from Start to the grid. Observing the picture, we can easily find that, for any i,j>0, dp[i][j]=dp[i-原创 2017-12-09 14:00:58 · 163 阅读 · 0 评论 -
[LeetCode] [C++] 20. Valid Parentheses
I used the data structure "Stack" here, which is convenient to solve this problem. When the parenthesis is a left parenthesis, I push it into the stack. And when the parenthesis is a right par原创 2017-11-22 21:47:50 · 167 阅读 · 0 评论 -
[LeetCode] [C++] 515. Find Largest Value in Each Tree Row
When seeing this problem, which let us find something in each tree row, I thought I could solve this problem by using "Level-order Traversal". The code is as follows. The Runti原创 2017-11-21 22:31:04 · 178 阅读 · 0 评论