不同的路径

 1 public class Solution {
 2     /**
 3      * @param n, m: positive integer (1 <= n ,m <= 100)
 4      * @return an integer
 5      */
 6     int sum = 0;
 7     public int uniquePaths(int m, int n) {
 8         // write your code here 
 9 //        move(m,n,0,0);
10 //        return sum;
11         int dp[] = new int[n];
12         for(int i = 0; i < n; i++) {
13             dp[i] = 1;
14         }
15         for(int i = 1; i < m; i++) {
16             for(int j = 1; j < n; j++) {
17                 dp[j] += dp[j-1];
18             }
19         }
20         return dp[n-1];
21     }
22     
23     void move(int m, int n, int i, int j) {
24         if(i == m-1 && j == n-1) {
25             sum++;
26         }else {
27             if(i+1<m) move(m,n,i+1,j);
28             if(j+1<n) move(m,n,i,j+1);
29         }
30     }
31 }