首页 > 代码库 > Unique Paths
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.
答案
public class Solution { public int uniquePaths(int m, int n) { if(m<=0||n<=0) { return 0; } if(n>m) { return uniquePaths(n,m); } int []ROW=new int[n]; int row; int col; for(col=0;col<n;col++) { ROW[col]=1; } for(row=m-2;row>=0;row--) { for(col=n-2;col>=0;col--) { ROW[col]=ROW[col]+ROW[col+1]; } } return ROW[0]; } }
Unique Paths
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。