Unique Paths(leetcode,dp,cpp)

 Unique Paths

--------------------------------------------------------

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

////////////////////////////////////////////////////////////////////////////////////////////// 

 

 

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