Fork me on GitHub
2017年3月6日
[leetcode-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 阅读全文
posted @ 2017-03-06 18:18 hellowOOOrld 阅读(164) 评论(0) 推荐(0)
leetcode-62-Unique Paths
摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文
posted @ 2017-03-06 17:17 hellowOOOrld 阅读(177) 评论(0) 推荐(0)