LeetCode-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 7 x 3 grid. How many possible unique paths are there?

Note:

m and n will be at most 100.

Example 1

Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Right -> Down
2. Right -> Down -> Right
3. Down -> Right -> Right

Example 2

Input: m = 7, n = 3
Output: 28

Solution 1(C++)

class Solution {
public:
    int uniquePaths(int m, int n) {
        double a=(double) m, b=(double) n;
        double res=1.0;
        for(double i=1.0; i<b; i++){
            res *= (a-1.0+i)/i;
        }
        return (res > 0.0) ? floor(res + 0.5) : ceil(res - 0.5); 
    }
};

Solution 2(C++)

class Solution {
public:
    int uniquePaths(int m, int n) {

        if(m == 1 || n == 1) return 1;

        vector<int> dp(n,0);
        dp[0] = 1;

        for(int i = 0; i < m; ++i){
            for(int j = 1; j < n; ++j){
                dp[j] += dp[j-1];
            }
        }
        return dp[n-1];
    }
};

Solution 3(C++)

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m == 1 || n == 1) return 1;
        vector<vector<int>> dp(m, vector<int>(n, 0));
        for(int i=0; i<m; i++){
            for(int j=0; j<n; j++)
                if(i==0||j==0) dp[i][j]=1;
                else dp[i][j] = dp[i-1][j] + dp[i][j-1];
        }
        return dp[m-1][n-1];
    }
};

后续更新

2018-5-14遇到的类似的题目可参考：

1. LeetCode-63. Unique Paths II

算法分析

解法一是自己做的，用了排列组合的方法，但问题就是，阶乘！！会超过数的范围，所以需要通过解法一中的方法进行转换。

解法二是参考别人的，使用动态规划的方法，也根据dp的思想写出了二维dp矩阵。要注意一点就是i=0 || j=0的时候，dp[i][j]=1。

程序分析

四舍五入的方法：

return (res > 0.0) ? floor(res + 0.5) : ceil(res - 0.5); 

二维vector的创建：

vector<vector<int>> dp(m, vector<int>(n, 0));

二维vector元素访问：

dp[i][j]
而不是dp[i,j]