LeetCode Minimum Path Sum

最新推荐文章于 2020-03-21 17:46:13 发布

kassical

最新推荐文章于 2020-03-21 17:46:13 发布

阅读量488

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kassical/article/details/38887097

版权

LeetCode 专栏收录该内容

98 篇文章 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.

class Solution {
public:
	int minPathSum(vector<vector<int> > &grid) {
		unsigned int m = grid.size();
		unsigned int n = grid[0].size();

		if (m == 0 || n == 0)
			return 0;

		vector<vector<int> > array(m, vector<int>(n, 0));
		array[0][0] = grid[0][0];

		for (int i = 1; i < m; ++i) {
			array[i][0] = array[i - 1][0] + grid[i][0];
		}

		for (int j = 1; j < n; ++j) {
			array[0][j] = array[0][j - 1] + grid[0][j];
		}

		for (int i = 1; i < m; ++i) {
			for (int j = 1; j < n; ++j) {
				array[i][j] = (array[i - 1][j] < array[i][j - 1]  \
					? array[i - 1][j] : array[i][j - 1]) + grid[i][j];
			}
		}

		return array[m - 1][n - 1];
	}
};