https://leetcode.com/problems/unique-paths/
class Solution {
public:
int uniquePaths(int m, int n) {
if(m==0||n==0) return 0;
int res=0, dp[m+5][n+5],i=0,j=0;
memset(dp,0,sizeof(dp));
for(i=0;i<m;i++)dp[i][0]=1;
for(j=0;j<n;j++)dp[0][j]=1;
for(i=1;i<m;i++){
for(j=1;j<n;j++){
dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
return dp[m-1][n-1];
}
};