@@ -0,0 +1,891 @@
+/**%0A * 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.%0A **/%0A%0Apublic class Solution %7B%0A    public int minPathSum(int%5B%5D%5B%5D grid) %7B%0A        if(grid == null)%0A            return 0;%0A        int m, n;%0A        if((m = grid.length) == 0)%0A            return 0;%0A        if((n = grid%5B0%5D.length) == 0)%0A            return 0;%0A        int%5B%5D%5B%5D pathSum = new int%5Bm%5D%5Bn%5D;%0A        pathSum%5Bm-1%5D%5Bn-1%5D = grid%5Bm-1%5D%5Bn-1%5D;%0A        for(int i=m-2; i%3E=0; i--)%0A            pathSum%5Bi%5D%5Bn-1%5D = grid%5Bi%5D%5Bn-1%5D + pathSum%5Bi+1%5D%5Bn-1%5D;%0A        for(int j=n-2; j%3E=0; j--)%0A            pathSum%5Bm-1%5D%5Bj%5D = grid%5Bm-1%5D%5Bj%5D + pathSum%5Bm-1%5D%5Bj+1%5D;%0A        for(int i=m-2; i%3E=0; i--)%0A            for(int j=n-2; j%3E=0; j--)%0A                pathSum%5Bi%5D%5Bj%5D = grid%5Bi%5D%5Bj%5D + Math.min(pathSum%5Bi+1%5D%5Bj%5D, pathSum%5Bi%5D%5Bj+1%5D);%0A        return pathSum%5B0%5D%5B0%5D;%0A    %7D%0A%7D%0A

Create 064.java