矩阵路径和(最小or最大)##

最新推荐文章于 2022-12-17 00:48:43 发布

syc596

最新推荐文章于 2022-12-17 00:48:43 发布

阅读量218

点赞数 1

文章标签：矩阵

本文链接：https://blog.csdn.net/A240428037/article/details/120271378

版权

NC59 矩阵的最小路径和

矩阵的最小路径和_牛客题霸_牛客网

JD1年终奖

年终奖_牛客题霸_牛客网

//矩阵最小路径和
class Solution {
public:
    int minPathSum(vector<vector<int>>&board) {
        int row=board.size();
        int col=board[0].size();
        vector<vector<int>>vv(row,vector<int>(col,0));
        vv[0][0]=board[0][0];
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(i==0&&j==0){
                    continue;
                }else if(i==0){
                    vv[i][j]=vv[i][j-1]+board[i][j];
                }else if(j==0){
                    vv[i][j]=vv[i-1][j]+board[i][j];
                }else{
                    vv[i][j]=min(vv[i-1][j],vv[i][j-1])+board[i][j];//min
                }
            }
        }
        return vv[row-1][col-1];
    }
};


//矩阵最大路径和
class Bonus {
public:
    int getMost(vector<vector<int> > board) {
        int row=board.size();
        int col=board[0].size();
        vector<vector<int>>vv(row,vector<int>(col,0));
        vv[0][0]=board[0][0];
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(i==0&&j==0){
                    continue;
                }else if(i==0){
                    vv[i][j]=vv[i][j-1]+board[i][j];
                }else if(j==0){
                    vv[i][j]=vv[i-1][j]+board[i][j];
                }else{
                    vv[i][j]=max(vv[i-1][j],vv[i][j-1])+board[i][j];//max
                }
            }
        }
        return vv[row-1][col-1];
    }
};