public class Solution {
    public int minPathSum(int[][] A) {
        int M = A[0].length;

        int N = A.length;

        int Mem[][] = new int[N][M];

        for (int i = 0; i < N; i++) {

            for (int j = 0; j < M; j++) {

                if (i == 0 && j == 0) {

                    Mem[i][j] = A[i][j];

                }
                else if (i == 0) {

                    Mem[i][j] = Mem[i][j - 1] + A[i][j];

                } else if (j == 0) {

                    Mem[i][j] = Mem[i - 1][j] + A[i][j];

                } else {

                    Mem[i][j] = Math.min(Mem[i - 1][j], Mem[i][j - 1]) + A[i][j];

                }

            }

        }

        return Mem[N - 1][M - 1];
    }
}