LeetCode -- Unique Paths

public class Solution {
    public int UniquePaths(int m, int n) {
        // m :  row
    	// n : col
    	
    	
    	if(m < 1){
    		return 0;
    	}
    	
    	if(m == 1){
    		return 1;
    	}
    	
    	var dp = new int[m, n];
    	
    	// set first [row, i] as 1 , i : [0,n)
    	for(var i = 0;i < n; i++){
    		dp[0, i] = 1;
    	}
    	
    	for(var i = 1;i < m; i++){
    		for(var j = 0;j < n; j++){
    			dp[i, j] = dp[i-1, j];
    			if(j > 0){
    				dp[i, j] += dp[i, j-1];
    			}
    		}
    	}
    	
    	return dp[m-1, n-1];
    }
}

LeetCode -- Unique Paths

原文：http://blog.csdn.net/lan_liang/article/details/48897081