LeetCode 64. Minimum Path Sum
摘要：
class Solution {public: int minPathSum(vector>& grid) { int n=grid.size(); int m=grid[0].size(); int dp[n+1][m+1]; me... 阅读全文
posted @ 2016-06-18 20:48 胖胖的乓乓 阅读(106) 评论(0) 推荐(0) 编辑
LeetCode 63. Unique Paths II
摘要：
class Solution {public: int uniquePathsWithObstacles(vector>& obstacleGrid) { if(obstacleGrid.size()==0){ return 0; } ... 阅读全文
posted @ 2016-06-18 20:25 胖胖的乓乓 阅读(95) 评论(0) 推荐(0) 编辑
LeetCode 62. Unique Paths
摘要：
class Solution {public: int nn,mm; int uniquePaths(int m, int n) { num=0; nn=m,mm=n; int dp[101][101]; for(int... 阅读全文
posted @ 2016-06-18 20:07 胖胖的乓乓 阅读(81) 评论(0) 推荐(0) 编辑
