题解 | #最小体重积#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param cows int整型vector<vector<>> 
     * @return long长整型
     */
    long long minPathProduct(vector<vector<int> >& cows) {
        // write code here
        int row = cows.size(), col = cows[0].size();
        vector<vector<long long>> dp(row, vector<long long>(col));
        for (int i = 0; i < col; i++) {
            if (i == 0) {
                dp[0][0] = cows[0][0];
            } else {
                dp[0][i] = dp[0][i-1] * cows[0][i];
            }
        }
        for (int i = 1; i < row; i++) {
            dp[i][0] = dp[i-1][0] * cows[i][0];
        }
        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                dp[i][j] = min(dp[i-1][j], dp[i][j-1]) * cows[i][j];
            }
        }
        return dp[row-1][col-1];
    }
};