Unique Paths-阿里云开发者社区

开发者社区> 开发与运维> 正文
登录阅读全文

Unique Paths

简介: Dynamic Programming A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

Dynamic Programming

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.

C++代码:

#include<iostream>
using namespace std;

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

int main()
{
    Solution s;
    cout<<s.uniquePaths(3,7)<<endl;
}

 

版权声明:本文内容由阿里云实名注册用户自发贡献,版权归原作者所有,阿里云开发者社区不拥有其著作权,亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容,填写侵权投诉表单进行举报,一经查实,本社区将立刻删除涉嫌侵权内容。

分享:
开发与运维
使用钉钉扫一扫加入圈子
+ 订阅

集结各类场景实战经验,助你开发运维畅行无忧

其他文章