DP
lviiii
这个作者很懒,什么都没留下…
展开
-
LeetCode Solutions : Unique Paths I & II
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 point in time. The robot is t原创 2014-09-11 17:30:19 · 869 阅读 · 0 评论 -
LeetCode Solutions : 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原创 2014-08-11 13:55:04 · 623 阅读 · 0 评论