LeetCode.64

最新推荐文章于 2023-03-11 22:44:55 发布

EdVulcan

最新推荐文章于 2023-03-11 22:44:55 发布

阅读量166

点赞数

分类专栏： C/C++ LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/qq_25371205/article/details/77962367

版权

C/C++ 同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

LeetCode

16 篇文章 0 订阅

订阅专栏

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.

int minPathSum(vector< vector<int> >& grid) {
	if(grid.empty()){
		return 0;
	}
	int h = grid.size(), w = grid[0].size(), temp;
	int arr[h][w];
	arr[h - 1][w - 1] = grid[h - 1][w - 1];
	for(int i = w - 2; i >= 0; i--){
		arr[h - 1][i] = arr[h - 1][i + 1] + grid[h - 1][i];
	}
	for(int i = h - 2; i >= 0; i--){
		arr[i][w - 1] = arr[i + 1][w - 1] + grid[i][w - 1];
	}
	for(int i = h - 2; i >= 0; i--){
		for(int j = w - 2; j >= 0; j--){
			temp = arr[i + 1][j] < arr[i][j + 1] ? arr[i + 1][j] : arr[i][j + 1];
			arr[i][j] = temp + grid[i][j];
		}
	}
	return arr[0][0];
}