62. Unique Paths

最新推荐文章于 2022-12-17 10:35:17 发布

linglingconglin

最新推荐文章于 2022-12-17 10:35:17 发布

阅读量67

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/u013260370/article/details/81120348

版权

算法专栏收录该内容

55 篇文章 0 订阅

订阅专栏

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?

方法1：从左上角走到右下角：每一个点的路径和为左1和正上两个点的路径数总和，最左边和最上边所有的点的路径都为1.

方法2：递归求和（超时）

class Solution {
public:
    int uniquePaths(int m, int n) {
        int a[m][n];
        for(int i=0;i<n;i++){
            a[0][i]=1;
        }
        for(int j=0;j<m;j++){
            a[j][0]=1;
        }
        for(int i=1;i<m;i++){
            for(int j=1;j<n;j++){
                a[i][j]=a[i-1][j]+a[i][j-1];
            }
        }
        return a[m-1][n-1];
    }
    /*void findPath(int m,int n,int &num,int mc,int nc){
        if(mc==m-1&&nc==n-1){
            num++;
            return;
        }
        if(mc<m-1){
            findPath(m,n,num,mc+1,nc);
        }
        if(nc<n-1){
            findPath(m,n,num,mc,nc+1);
        }
    }
    int uniquePaths(int m, int n) {
        int num=0;
        int a[m][n];
        findPath(m,n,num,0,0);
        return num;
    }*/
};