Unique Paths

动态规划二位数组

class Solution {
public:
    int uniquePaths(int m, int n) {
        //c[i][j] = c[i-1][j] + c[i][j-1];
        if(m==0 || n==0)
          return 0;
        if(m==1 || n==1)
          return 1;
        int** c = new int*[m+1];
        for(int k=0;k<m+1;k++)
        {
           c[k] = new int[n+1];
        }
        for(int i=0;i<m+1;i++)
               c[i][0] = 0;
        for(int i=0;i<n+1;i++)
               c[0][i] = 0;



        for(int i=1;i<m+1;i++)
            for(int j=1;j<n+1;j++)
           {
             if(i==1 && j==1)
                 c[i][j] = 1;
             else
                 c[i][j] = c[i-1][j] + c[i][j-1];
           }
        return c[m][n];
    }
};