1

Author: Ashish-kumar7

leetcode-explore-challenge-card-30-day-leetcoding-challenge-530-week-3-3303.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    int minPathSum(vector<vector<int>>& A) {
+        
+        int m=A.size();
+        int n=A[0].size();
+        
+        int dp[m][n];
+        
+        for(int i=0;i<m;i++){
+            for(int j=0;j<n;j++){
+                dp[i][j]=0;
+            }
+        }
+        for(int i=0;i<m;i++){
+            for(int j=0;j<n;j++){
+                
+                dp[i][j]+=A[i][j];
+                
+                if(i>0 && j>0){
+                    dp[i][j]+=min(dp[i-1][j],dp[i][j-1]);
+                }
+                else if(i>0) {
+                    dp[i][j]+=dp[i-1][j];
+                }
+                else if(j>0){
+                    dp[i][j]+=dp[i][j-1];
+                }                
+            }
+        }    
+        return dp[m-1][n-1];   
+    }
+};