leetCode刷题归纳-Dynamic Programming(62. 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?

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

Note: m and n will be at most 100.

Subscribe to see which companies asked this question.

解题思路

---

1.m and n will be at most 100.–数据量不大
2.典型的动态规划问题，求最短路径
3.考虑point (i, j) 状态是P[i][j], 状态方程P[i][j] = P[i - 1][j] + P[i][j - 1].

解法1.考虑每一个点状态，设置二维状态数组
时空复杂度-O(n^2)->time O (m*n)->space

class Solution {
    int uniquePaths(int m, int n) {
        vector<vector<int> > path(m, vector<int> (n, 1));
        for (int i = 1; i < m; i++)
            for (int j = 1; j < n; j++)
                path[i][j] = path[i - 1][j] + path[i][j - 1];
        return path[m - 1][n - 1];
    }
};

解法2：考虑列状态，将状态数组设计为一维
空间复杂度优化为 O(min(m, n))

class Solution {
    int uniquePaths(int m, int n) {
        if (m > n) return uniquePaths(n, m); 
        vector<int> pre(m, 1);
        vector<int> cur(m, 1);
        for (int j = 1; j < n; j++) {
            for (int i = 1; i < m; i++)
                cur[i] = cur[i - 1] + pre[i];
            swap(pre, cur);
        }
        return pre[m - 1];
    }
};