Leetcode 64 Minimum Path Sum
发布时间：2020-12-13 21:15:59 所属栏目：PHP教程 来源：网络整理
导读：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. 和62，63如出1辙的套路，
|
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. 和62，63如出1辙的套路，没甚么含量class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
if(grid.size()==0) return 0;
for(int i=1;i<grid.size();i++)
grid[i][0]+=grid[i⑴][0];
for(int i=1;i<grid[0].size();i++)
grid[0][i]+=grid[0][i⑴];
for(int i=1;i<grid.size();i++)
for(int j=1;j<grid[0].size();j++)
grid[i][j]+=min(grid[i⑴][j],grid[i][j⑴]);
return grid[grid.size()⑴][grid[0].size()⑴];
}
}; （编辑：李大同） 【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容! |