LeetCode | Minimum Path Sum
来源:互联网 发布:人工智能前沿技术 编辑:程序博客网 时间:2024/06/03 23:02
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.
public class Solution { //思想与解法同二维dynamic programming的苹果收集问题public int minPathSum(int[][] grid) {int m = grid.length; // 取得rowsint n = grid[0].length; // 取得cols// 状态变量:states[i][j]表示达到点(i-1, j-1)的最小路径和int states[][] = new int[m][n];int sum_1 = 0;for (int i = 0; i < n; i++) { //填充状态变量第0行sum_1 += grid[0][i];states[0][i] = sum_1;}int sum_2 = 0;for (int j = 0; j < m; j++) { //填充状态变量第0列sum_2 += grid[j][0];states[j][0] = sum_2;}if (m < 2 || n < 2) { //避免下面的数组发生(index = -1)溢出return states[m - 1][n - 1];}// 状态转移方程:达到点(i,j),要么从上面到达,要么从左面达到// states[i][j] = min( states[i-1][j]+grid[i][j], states[i][j-1]+grid[i][j] ), { i>=1, j>=1}for (int i = 1; i < m; i++) {for (int j = 1; j < n; j++) {states[i][j] = Math.min(states[i-1][j] + grid[i][j], states[i][j-1] + grid[i][j]);}}return states[m - 1][n - 1];}}
0 0
- LeetCode: Minimum Path Sum
- LeetCode Minimum Path Sum
- LeetCode : Minimum Path Sum
- [Leetcode] Minimum Path Sum
- [LeetCode] Minimum Path Sum
- [Leetcode] Minimum Path Sum
- [LeetCode]Minimum Path Sum
- [leetcode]Minimum Path Sum
- LeetCode-Minimum Path Sum
- [leetcode] Minimum Path Sum
- LeetCode - Minimum Path Sum
- LeetCode:Minimum Path Sum
- leetcode minimum path sum
- 【leetcode】Minimum Path Sum
- 【LeetCode】Minimum Path Sum
- Leetcode: Minimum Path Sum
- Leetcode Minimum Path Sum
- LeetCode Minimum Path Sum
- c#调用DLL
- nginx+php+mysql服务器搭建
- 循环单链表的基本操作
- 微商如何购买微信小号推广?
- 两个链表的第一个公共结点
- LeetCode | Minimum Path Sum
- MySQL部分解疑
- 【ExtJs】柱状图,改变每条柱子的颜色
- 从一个菜鸟开始学习机器学习
- 【HDU】5221 Occupation【树链剖分】
- 流随机访问
- Windows版OpenVPN安装、配置教程
- Ruby七天入门(2 函数,数组和类)
- STL--迭代器--原理与实践