- 博客(4)
- 收藏
- 关注
原创 [leetcode]111.Minimum Depth of Binary Tree
111. Minimum Depth of Binary TreeGiven 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.题目链接:111
2016-05-31 16:23:30 636
原创 [Leetcode刷题总结系列][Dynamic Programming]63. Unique Paths II
Unique Paths IIFollow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?leetcode第63题
2016-05-20 15:28:41 613
转载 LaTeX新人教程,30分钟从完全陌生到基本入门
LaTeX新人教程,30分钟从完全陌生到基本入门本教程面向对LaTeX完全无认知无基础的新人旨在让新人能够用最简单快捷的方式,轻松入门,能够迅速使用LaTeX完成基本的文本编辑。 这个教材最终能够达到的水平是能够使用LaTeX写一篇正常的proposal
2016-05-18 19:51:53 996
原创 [Leetcode刷题总结系列][Dynamic Programming]62. Unique Paths
Leetcode Dynamic Programming62. Unique PathsA robot is located at the top-left corner of a m*n grid.The robot only moves either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid.How many unique paths
2016-05-02 04:59:13 648
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人