package com.fishercoder.solutions;

/**64. Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.*/
public class _64 {
  public static class Solution1 {
    /**
     * Same idea as _70: have to initialize the first row and the first column and start the for
     * loop from i==1 and j==1 for the rest of the matrix.
     */
    public int minPathSum(int[][] grid) {
      if (grid == null || grid.length == 0) {
        return 0;
      }

      int height = grid.length;
      int width = grid[0].length;
      int[][] dp = new int[height][width];
      dp[0][0] = grid[0][0];
      for (int i = 1; i < height; i++) {
        dp[i][0] = dp[i - 1][0] + grid[i][0];
      }
      for (int j = 1; j < width; j++) {
        dp[0][j] = dp[0][j - 1] + grid[0][j];
      }
      for (int i = 1; i < height; i++) {
        for (int j = 1; j < width; j++) {
          dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
        }
      }
      return dp[height - 1][width - 1];
    }
  }
}

@@ -32,16 +32,20 @@
 ns;%0A%0A/**
+%0A * 
 64. Mini
@@ -57,17 +57,22 @@
 ath Sum%0A
-%0A
+ *%0A * 
 Given a 
@@ -213,17 +213,22 @@
 s path.%0A
-%0A
+ *%0A * 
 Note: Yo
@@ -285,16 +285,18 @@
 in time.
+%0A 
 */%0Apubli
@@ -311,16 +311,18 @@
 _64 %7B%0A  
+ 
+ 
 public s
@@ -345,16 +345,20 @@
 tion1 %7B%0A
+    
     /**%0A
@@ -362,16 +362,20 @@
 **%0A     
+    
 * Same i
@@ -463,16 +463,20 @@
 or%0A     
+    
 * loop f
@@ -526,19 +526,27 @@
 x.%0A     
+   
+ 
 */%0A
+    
     publ
@@ -585,16 +585,22 @@
 %7B%0A      
+     
+ 
 if (grid
@@ -627,24 +627,32 @@
 gth == 0) %7B%0A
+        
         retu
@@ -667,11 +667,23 @@
     
+  
-%7D%0A%0A
+    %7D%0A%0A      
     
@@ -712,24 +712,30 @@
 ngth;%0A      
+ 
+     
 int width = 
@@ -746,24 +746,30 @@
 %5B0%5D.length;%0A
+      
       int%5B%5D%5B
@@ -799,16 +799,22 @@
 width%5D;%0A
+      
       dp
@@ -836,24 +836,30 @@
 %5D%5B0%5D;%0A      
+    
+  
 for (int i =
@@ -873,32 +873,40 @@
  height; i++) %7B%0A
+        
         dp%5Bi%5D%5B0%5D
@@ -933,34 +933,46 @@
 id%5Bi%5D%5B0%5D;%0A      
+ 
-%7D%0A
+     %7D%0A      
       for (int j
@@ -987,32 +987,40 @@
 %3C width; j++) %7B%0A
+        
         dp%5B0%5D%5Bj%5D
@@ -1051,26 +1051,38 @@
 %5D%5Bj%5D;%0A      
+   
-%7D%0A
+   %7D%0A      
       for (i
@@ -1110,32 +1110,40 @@
  i++) %7B%0A        
+ 
+       
 for (int j = 1; 
@@ -1152,32 +1152,42 @@
 %3C width; j++) %7B%0A
+          
           dp%5Bi%5D%5B
@@ -1254,18 +1254,38 @@
     
+     
-%7D%0A
+   %7D%0A     
       
+ 
 %7D%0A
+      
     
@@ -1324,16 +1324,22 @@
 1%5D;%0A    
-%7D%0A
+    %7D%0A  
   %7D%0A%7D%0A

refactor 64