leetcode:Minimum Path Sum

原创于 2014-10-20 19:07:07 发布 · 345 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

168 篇文章

订阅专栏

本文介绍了一个简单的递推算法，用于解决从矩阵左上角到右下角寻找路径的问题，目标是最小化路径上的数值总和。算法通过动态更新矩阵单元格来记录到达每个位置的最小路径和。

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 {
    
    public int minPathSum(int[][] grid) {
        int row = grid.length;
        int col = grid[0].length;
        for(int i = 0; i < grid.length; ++i){
            for(int j = 0; j < grid[0].length; ++j){
                if(i == 0){
                    if(j != 0){
                        grid[i][j] += grid[i][j - 1];
                    }
                }
                else if(j == 0){
                    if(i != 0){
                        grid[i][j] += grid[i - 1][j];
                    }
                }
                else{
                    grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
                }
            }
        }
        return grid[row - 1][col - 1];
    }
    
    
    
    
}