题解 | #最小体重积#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param cows int整型二维数组 
     * @return long长整型
     */
    public long minPathProduct (int[][] cows) {
        // write code here
        int m = cows.length;
        int n = cows[0].length;
        long [][] dp = new long [m+10][n+10];
        

        

        for(int i = 0;i<m;i++){
            for(int j = 0;j<n;j++){
                dp[i][j] = 1;
                if(i == 0 & j == 0){
                    dp[0][0] = cows[0][0];
                    continue;
                } 
                if(i == 0 && j != 0){
                    dp[i][j] = dp[i][j-1] * cows[i][j];
                }else if(i!=0 && j == 0){
                    dp[i][j] = dp[i-1][j] * cows[i][j];
                }else{
                    dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1]) * cows[i][j];
                }
            }
        }

        return dp[m-1][n-1];
    }
}