首页 > 代码库 > leetcode - Minimum Path Sum
leetcode - 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.
//利用dp解决,动态转移方程为: // dp[i][j] = min(dp[i-1][j],dp[i][j-1]) + grid[i][j]. class Solution { public: int minPathSum(std::vector<std::vector<int> > &grid) { std::vector<std::vector<int>> dp(grid.size(),std::vector<int>(grid[0].size(),0)); dp[0][0] = grid[0][0]; for (int i = 1; i < grid.size(); i++) { dp[i][0] = dp[i-1][0] + grid[i][0]; } for (int i = 1; i < grid[0].size(); i++) { dp[0][i] = dp[0][i-1] + grid[0][i]; } for (int i = 1; i < grid.size(); i++) { for (int j = 1; j < grid[0].size(); j++) { dp[i][j] = std::min(dp[i-1][j],dp[i][j-1]) + grid[i][j]; } } return dp[grid.size()-1][grid[0].size()-1]; } };
leetcode - Minimum Path Sum
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。