LeetCode
shinefire
这个作者很懒,什么都没留下…
展开
-
62.Unique Paths
Unique Paths原创 2017-03-05 15:24:44 · 409 阅读 · 0 评论 -
69.Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.求一个数的平方根,比较容易的方法是采用二分法不断逼近,不过比较有意思的是牛顿迭代法,这里有一个比较清晰的解释。原创 2017-03-05 17:56:10 · 248 阅读 · 0 评论 -
63. Unique Paths II
Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.原创 2017-03-05 16:11:04 · 230 阅读 · 0 评论