LeetCode 64

 

public class MinPathSum {
    /**
     * 第64题
     * 给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，
     * 使得路径上的数字总和为最小。说明：每次只能向下或者向右移动一步。
     * [1,3,1],
     * [1,5,1],
     * [4,2,1]
     * <p>
     * 解法：
     * 用一维数组，时间复杂度O(n2)，空间复杂度O(min(m,n))
     *
     * @param grid
     * @return
     */
    public static int minPathSum(int[][] grid) {
        int m = grid[0].length;
        int n = grid.length;
        int[] arr = null;

        if(m < n) {
            arr = new int[m];
            //初始化
            arr[m-1] = grid[n - 1][m-1];
            for (int i = m - 2; i >= 0; i--) {
                arr[i] = grid[n - 1][i] + arr[i+1];
            }
            for (int i = n - 2; i >= 0; i--) {
                for (int j = m - 1; j >= 0; j--) {
                    if (j == m - 1) {
                        arr[j] += grid[i][j];
                    } else {
                        arr[j] = grid[i][j] + Math.min(arr[j], arr[j + 1]);
                    }
                }
            }
        } else {
            arr = new int[n];
            //初始化
            arr[n-1] = grid[n - 1][m-1];
            for (int i = n - 2; i >= 0; i--) {
                arr[i] = grid[i][m-1] + arr[i+1];
            }

            for (int i = m - 2; i >= 0; i--) {
                for (int j = n - 1; j >= 0; j--) {
                    if (j == n - 1) {
                        arr[j] += grid[j][i];
                    } else {
                        arr[j] = grid[j][i] + Math.min(arr[j], arr[j + 1]);
                    }
                }
            }
        }

        return arr[0];
    }

    public static void main(String[] args) {
        int[][] gird = new int[][]{{1, 3, 1},{1, 5, 1}, {4, 2, 1}};
        int i = MinPathSum.minPathSum(gird);
        System.out.println(i);
    }
}