矩阵从左上角到右下角的最小路径值

public class Temp {

    public static int minPathNum(int[][] data, int startI, int startJ, int endI, int endJ) {
        int sum = Integer.MAX_VALUE;
        int i = startI;
        int j = startJ;

        if (startI == endI && startJ == endJ) {
            return data[startI][startJ];
        }

        if (i < endI) {
            sum = Math.min(sum, data[i][j] + minPathNum(data, startI + 1, j, endI, endJ));
        }

        if (j < endJ) {
            sum = Math.min(sum, data[i][j] + minPathNum(data, i, startJ + 1, endI, endJ));
        }

        return sum;
    }

    public static void main(String[] args) {
        int[][] data = {
                {1, 2, 3},
                {4, 0, 6},
                {7, 8, 9}
        };

        int m = data.length;
        int n = data[0].length;

        System.out.println(minPathNum(data, 0, 0, m - 1, n - 1));
    }
}