算法设计与结构基础作业第十六周

62.Unique Paths

Description:

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?

Above is a 3 x 7 grid. How many possible unique paths are there?

分析：

本来这题打算直接递归的，但是超时了，分析原因是因为多次重复计算做过的操作所致，比

 

如 path[i][j]可能在不同的递归实例中被多次计算。于是考虑打表，然后输出 path[m][n]就行了。

My C++ code:

class Solution { public:

int uniquePaths(int m, int n) { int path[101][101]; for(int i = 1;i <= m;i++)

{

path[i][1] = 1;

}

for(int i = 1;i <= n;i++)

{

path[1][i] = 1;

}

for(int i = 2;i <= m;i++) for(int j = 2;j <= n;j++)

path[i][j] = path[i - 1][j] + path[i][j - 1];

return path[m][n];

}

};

63.Unique Paths II

Description:

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.

Note: m and n will be at most 100.

分析：

这道题和上道题基本类似，不过就是多了一步判断是不是 obstacle。如果是的话就 path[i][j]

 

值为零。然后初始化都是零，把 path[0][1]设成 1 是为了循环的开始能有个 1。

My C++ code:

class Solution { public:

int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int m = obstacleGrid.size();

int n = obstacleGrid[0].size();

vector <vector<int>> path(m+1,vector<int>(n+1,0)); path[1][0] = 1;//path[0][1] = 1;

for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++)

if(!obstacleGrid[i-1][j-1])path[i][j] = path[i-1][j] + path[i][j-1];

return path[m][n];

}

};