| 23 | return v[currRow][currCol]; |
| 24 | } |
| 25 | int minFallingPathSum(vector<vector<int>>& matrix) |
| 26 | { |
| 27 | int m = matrix.size(); //total number of rows |
| 28 | int n = matrix[0].size();//total number of columns |
| 29 | vector<vector<int>>v(m,vector<int>(n,-1)); |
| 30 | int ans=100001; |
| 31 | for(int i=0;i<n;i++) |
| 32 | ans= min(ans,minSum(0,i,m,n,matrix,v)); |
| 33 | |
| 34 | return ans; |
| 35 | } |
| 36 | |
| 37 | int main() |
| 38 | { |