1、矩阵的最小路径和 class Solution { public: int minPathSum(vector<vector<int>>& grid) { int m=grid.size(); if(m==0) return 0; int n=grid[0].size(); vector<vector<int>> dp(m,vector<int>(n,0)); dp[0][0] = grid[0][0]; for(int i=1;i<m;i++) dp[i][0] = dp[i-