class Solution {
public:
int minFallingPathSum(vector<vector<int>>& arr) {
int N = arr.size();
int M = arr[0].size();
vector<vector<int>> dp(N+1,vector<int>(M));
int ans = 0x3f3f3f3f;
for(int i=1;i<=N;i++){
for(int j=0;j<M;j++){
dp[i][j] = 0x3f3f3f3f;
for(int k=0;k<M;k++){
if(j==k) continue;
dp[i][j] = min(dp[i][j],dp[i-1][k]+arr[i-1][j]);
}
}
}
for(int j=0;j<M;j++) ans = min(ans,dp[N][j]);
return ans;
}
};
No.157 - LeetCode? - Minimum Falling Path Sum II
最新推荐文章于 2024-10-14 18:52:56 发布