LeetCode#62. Unique Paths
来源:互联网 发布:语音朗读软件 编辑:程序博客网 时间:2024/06/01 18:24
题意:
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.
题目分析:这道题分析出其算法即可,一道高中组合计算的问题,若有m行和n列,并且只能向下或者向右,则共有m+n-2步,其中向右m-1步,向下n-1步。
即决定好m+n-1中哪m-1步向右即可,就是计算组合数C(m+n-1,m-1)
一种c++实现方式如下:
class Solution {public: int uniquePaths(int m, int n) { int total = m+n-2; double u_num; u_num = fact(total)/(fact(n-1)*fact(total-n+1)); if((u_num -(int)u_num) >= 0.5) return u_num+1; else return u_num; } double fact(int n) { double res = 1; for(int i = 1; i <= n; i++) { res *= i; } return res; }};
注意这里因为范围过大,故采用double计算,将计算得到的结果四舍五入即可
阅读全文
0 0
- [LeetCode]62.Unique Paths
- LeetCode --- 62. Unique Paths
- LeetCode 62.Unique Paths
- [Leetcode] 62. Unique Paths
- [leetcode] 62.Unique Paths
- [leetcode] 62.Unique Paths
- leetcode 62. Unique Paths
- Leetcode 62. Unique Paths
- [leetcode] 62. Unique Paths
- 62. Unique Paths LeetCode
- [LeetCode]62. Unique Paths
- 【LeetCOde】62. Unique Paths
- [LeetCode]62. Unique Paths
- leetcode 62. Unique Paths
- LeetCode 62. Unique Paths
- LeetCode *** 62. Unique Paths
- leetcode 62. Unique Paths
- Leetcode:62. Unique Paths
- 历史记录
- TensorFlow入门教程集合
- ECharts官方教程(九)【ECharts中的事件和行为】
- ECharts官方教程(十)【小例子:自己实现拖拽】
- SSL双向认证下提升用户友好性的两例
- LeetCode#62. Unique Paths
- Rust : ? 操作符(待续)
- ECharts官方教程(十一)【小例子:实现日历图】
- ECharts官方教程(十二)【自定义系列】
- D3D11和D3D12多线程渲染框架的比较(五)
- 如何让DIV变成默认高度,如果内容过长自动加长
- ECharts官方教程(十三)【富文本标签】
- IDW
- 代理模式--动态代理 cglic