【算法】【Dynamic Programming】Unique Paths

Difficulty: Medium

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?

Note: m and n will be at most 100.

Solution

思路

记 robot 从 Start 到点 (i, j) 的不同路径数为 path[i][j]. 因为 robot 只能往右和往下移动，所以可递推得到 path[i][j] = path[i][j - 1] + path[i - 1][j].

假设m >= n，则只需记录0 <= i < m和0 <= j <= i且j < n的 path, 其他都是不需要的.

我用一维数组来模拟二维数组. 由于 m * n 数量会很大，且该二维数组是对称的，故只需记录数组的一半。

代码

通过Leetcode测试.

class Solution {

// 只记录二维数组的左下三角部分
#define k(a, b) ((a >= b) ? (((1 + a) * a) / 2 + b) : (((1 + b) * b) / 2 + a))
public:
    int uniquePaths(int m, int n) {
        if (m < n) {
            int temp = m;
            m = n;
            n = temp;
        }
        int* path = new int[((1 + m) * m) / 2];

        int i = 0, j = 0;
        // 到达path[i][0]的路径数只有1
        for (i = 0; i < m; ++i) path[k(i, 0)] = 1;
        for (i = 1; i < m; ++i) {
            for (j = 1; j < n && j <= i; ++j) {
                path[k(i, j)] = path[k((i - 1), j)] + path[k(i, (j - 1))];
            }
        }
        int result = path[k((m - 1), (n - 1))];
        delete[] path;
        return result;
    }
};