LeetCode:Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

动态规划：result[n][d] = result[n - 1][d] + result[n][d - 1]; 

题目中说输入参数不会超过100，其实如果到了100 int就精度就不够了。

package leetcode;

public class UniquePaths {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		UniquePaths s = new UniquePaths();
		long ss = s.uniquePaths(100, 100);
		System.out.println(ss);

	}
	
	private long[][] result = new long[101][101];
	boolean flag = false;
	public int uniquePaths(int m, int n) {
		if (!flag) {
			dp();
			flag = true;
		}
		return  (int) result[n][m];

	}
	
	void dp() {
		for (int m = 1; m <= 100; m++) {
			result[1][m] = 1;
		}
		
		for (int n = 1; n <= 100; n++) {
			result[n][1] = 1;
		}
		
		int d = 2;
		while (d <= 100) {
			for (int n = d; n <= 100; n++) {
				result[n][d] = result[n - 1][d] + result[n][d - 1]; 
			}
			
			for (int m = d; m <= 100; m++) {
				result[d][m] = result[d - 1][m] + result[d][m - 1]; 
			}
			
			d++;
		}
	}

}