2016年5月28日
LeetCode OJ 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. 阅读全文
posted @ 2016-05-28 12:07 Black_Knight 阅读(246) 评论(0) 推荐(0)
LeetCode OJ 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 @ 2016-05-28 09:54 Black_Knight 阅读(213) 评论(0) 推荐(0)