Unique Paths

recursion programming

public class Solution {
    public int uniquePaths(int m, int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int[][] result = new int[m+1][n+1];
        result[1][1] = 1;
        for(int i = 1; i < m+1; i++)
            for(int j = 1; j < n+1; j++){
                result[i][j] += result[i-1][j] + result[i][j-1]; 
            }
        return result[m][n];
    }
}