程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> [LeetCode]Minimum Path Sum

[LeetCode]Minimum Path Sum

編輯:C++入門知識

[LeetCode]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 {
	private int f[][];
	private int g[][];
	public int minPathSum(int[][] grid) {
		int m = grid.length;
		int n = grid[0].length;
    	f = new int[m+1][n+1];
    	g= grid;
    	return dfs(m,n);
    }
    
    private int dfs(int m,int n){
    	if(m<1||n<1) return 2000000000;
    	if(m==1&&n==1) return g[0][0];
    	return Math.min(help(m-1,n),help(m,n-1))+g[m-1][n-1];
    }
    
    private int help(int m,int n){
    	if(f[m][n]>0) return f[m][n];
    	return f[m][n] = dfs(m,n);
    }
}



  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved