Time: 11 ms (34.35%), Space: 47.5 MB (56.95%) - LeetHub

Author: rahul003t

0931-minimum-falling-path-sum/0931-minimum-falling-path-sum.java

@@ -0,0 +1,41 @@
+class Solution {
+    public int minFallingPathSum(int[][] matrix) {
+        int n = matrix.length;
+        int[][] dp = new int[n][n];
+        int min= Integer.MAX_VALUE;
+        
+        for(int i=0;i<n;i++)
+        {
+            dp[0][i] = matrix[0][i];
+        }
+        
+        for(int i=1;i<n;i++)
+        {
+            for(int j=0;j<n;j++)
+            {
+                if(j==0)
+                {
+                    dp[i][j] = matrix[i][j]+Math.min(dp[i-1][j],dp[i-1][j+1]);
+                    
+                }
+                else if( j == n-1)
+                {
+                    dp[i][j] = matrix[i][j] + Math.min(dp[i-1][j-1],dp[i-1][j]);
+                }
+                else
+                {
+                    dp[i][j] = matrix[i][j] + Math.min(Math.min(dp[i-1][j-1],dp[i-1][j]),dp[i-1][j+1]);
+                }
+            }
+            
+        }
+        for(int i=0; i<n ;i++)
+            {
+                if(dp[n-1][i] < min)
+                {
+                    min = dp[n-1][i];
+                }
+            }
+        return min;
+    }
+}