本文共 850 字，大约阅读时间需要 2 分钟。

class Solution {
   public:    vector
   
     pathsWithMaxScore(vector
    
     & board) {
           int N = board.size();        int M = board[0].length();        const long long mod = 1000000007;        vector
     
      
       > dp(N+1,vector
       
        (M+1,0));        vector
        
         
          > path(N+1,vector
          
           (M+1,0)); path[N][M] = 1; for(int i=N-1;i>=0;i--){ for(int j=M-1;j>=0;j--){ if(board[i][j] == 'X') continue; long long score = board[i][j] - '0'; if(board[i][j] == 'S' || board[i][j] == 'E') score = 0; long long mx = max(dp[i+1][j+1],max(dp[i+1][j],dp[i][j+1])); dp[i][j] = mx + score; if(mx == dp[i+1][j+1]) path[i][j] += path[i+1][j+1]; if(mx == dp[i+1][j]) path[i][j] += path[i+1][j]; if(mx == dp[i][j+1]) path[i][j] += path[i][j+1]; path[i][j] %= mod; } } if(path[0][0] == 0) return { 0,0}; return { dp[0][0],path[0][0]}; }};
          
         
        
       
      
     
    
   

转载地址：http://ctgci.baihongyu.com/