不同的路径

class Solution {
public:
    /**
     * @param n, m: positive integer (1 <= n ,m <= 100)
     * @return an integer
     */
    int uniquePaths(int m, int n) {
        // wirte your code here
        vector<vector<int> > f(m, vector<int>(n,0));
        
        for(int i = 0; i < n; i++)
            f[0][i] = 1;
            
        for(int i = 0; i < m; i++)
            f[i][0] = 1;
            
        for(int i = 1; i < m; i++)
            for(int j = 1; j < n; j++)
                f[i][j] = f[i-1][j] + f[i][j-1];
                
        return f[m-1][n-1];
    }
};

vector创建二维数组
1.vector<vector<int> > f(m, vector<int>(n));   f为m*n的二维数组
2.vector<vector<int> > f(m, vector<int>(n,0)); f为m*n的二维数组，且元素都为0
3.vector <   vector <int>   >   array(3); 
   for(int   i=0;i <3;i++) 
	array[i].resize(3);//设置数组的大小3X3