网格路径总数

有一个机器人的位于一个 m × n 个网格左上角。机器人每一时刻只能向下或者向右移动一步。机器人试图达到网格的右下角。问有多少条不同的路径？

public class UniquePaths {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt();
		int n = sc.nextInt();
		sc.close();
		int record = 1;
		record = uniquePaths(m, n);
		System.out.println(record);
	}

	public static int uniquePaths(int m, int n) {
		int[][] record = new int[m][n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				record[i][j] = 1;
			}
		}

		for (int i = 1; i < record.length; i++) {
			for (int j = 1; j < record[i].length; j++) {
				record[i][j] = record[i - 1][j] + record[i][j - 1];
			}
		}
		return record[m - 1][n - 1];
	}
}