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** p; 
		int result;
		
		p= new int*[m];
		
		for (int i = 0; i <m; i++)
		{
			 p[i] = new int[n];
		}
		for (int i = 0; i <m; i++)
		{
			p[i][0] = 1;
		}
		for (int i = 0; i <n; i++)
		{
			 p[0][i] = 1;
		}
		for (int i = 1; i <m; i++)
		{
			for (int j = 1; j <n; j++)
			{
				p[i][j] = p[i-1][j] + p[i][j-1];
			}
		}
		result =  p[m-1][n-1];
		for (int i = 0; i <m; i++)
		{
			delete p[i];
		}
		delete p;
		return result;
	}
};