最小路径和

最小路径和

public static int text(int arr[][]){
		if(arr.length==0)
		{
			return 0 ;
		}
		int row = arr.length;
		int col = arr[0].length;
		int [][] dp = new int[row][col];
		dp[0][0]=arr[0][0];
		for (int i = 1; i < col; i++) {
			dp[0][i]=dp[0][i-1]+arr[0][i];
		}
		for (int i = 1; i < row; i++) {
			dp[i][0]=dp[i-1][0]+arr[i][0];
			for (int j = 1; j < col; j++) {
				dp[i][j]=arr[i][j]+Math.min(dp[i-1][j], dp[i][j-1]+arr[i][j]);
			}
		}
		return dp[row-1][col-1];
	}