zoukankan      html  css  js  c++  java
  • Minimum Path Sum

    Minimum Path Sum

    问题:

    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) {
            if(grid == null || grid.length == 0 || grid[0].length == 0) return -1;
            int row = grid.length;
            int col = grid[0].length;
            for(int i = 1; i < row; i++)
                grid[i][0] += grid[i-1][0];
            for(int j = 1; j < col; j++)
                grid[0][j] += grid[0][j-1];
            for(int i = 1; i < row ; i++)
            {
                for(int j = 1; j < col; j++)
                {
                    grid[i][j] += Math.min(grid[i-1][j],grid[i][j-1]); 
                }
            }
            return grid[row-1][col-1];
        }
    }
    View Code
  • 相关阅读:
    阅读ajax.pdf
    XPath 学习
    随想
    Angular JS 学习
    Angular JS 学习
    URL Rewrite in IIS with Regular Pattern
    LinQ In Action 学习第四章
    GC垃圾回收
    jvm底层
    类加载流程
  • 原文地址:https://www.cnblogs.com/sunshisonghit/p/4320554.html
Copyright © 2011-2022 走看看