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 Solution { public int minPathSum(int[][] grid) { int[][] matrix = new int[grid.length][grid[0].length]; for(int i=0; i