2017年5月24日
Leetcode:64. Minimum Path Sum
摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time. 阅读全文
posted @ 2017-05-24 20:21 JeffNice 阅读(123) 评论(0) 推荐(0)
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 is marked as 1 and 0 respectively in the grid. 阅读全文
posted @ 2017-05-24 19:26 JeffNice 阅读(153) 评论(0) 推荐(0)