[leetcode] 62. Unique Paths

原创 2016年08月30日 18:38:23

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?
这里写图片描述

思路:
第一种方法:
这里写图片描述
到达finish的方法数,是到达1和达到2方法的和,而到达1的方法是到达4和到达3方法的总和,到达2是到达4和到达5方法的综合依次类推,
因为只能向右或向下故第一行和第一列位置到达的方法数为1,
用一个m*n的二位数组存储到达各个方框的次数二维数组[m-1][n-1]保存的数即为最终结果。时间复杂度O(m*n),空间复杂度O(m*n);

第二种方法:
以题目给出的3*7为例,到达finish需要向下移动2次,向右移动6次 总共8次,这就转化成组合问题,从8步中选择两步向下移动其余向右移动,即这里写图片描述 空间复杂度为O(1);

方法一:
具体代码如下:

public class Solution {
    public int uniquePaths(int m, int n) {
        int result = 0;
        if(m ==0 || m ==0){
            return 0;
        }

        int[][] nums = new int[m][n];

        for(int i = 0; i < n; i++){
            nums[0][i] = 1;
        }
        for(int i = 0; i < m; i++){
            nums[i][0] = 1;
        }

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

        result = nums[m-1][n-1];
        return result;
    }
}

方法二:
具体代码如下:

public class Solution {
    public int uniquePaths(int m, int n) {
        long result = 1;
        if (m == 1 || n == 1) {
            return (int)result;
        }

        int x = m > n ? m : n;
        int y = m < n ? m : n;
        int chu = 1;

        int zonghe = m+n-2;
        for(int i =0; i < y-1; i++){
            result = result * (zonghe-i);

        }
        for(int i =0; i < y-1; i++){
            chu = chu * (i+1);
        }
        return (int)(result/chu);
    }
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

leetcode - 62,63. Unique Paths(II) & 64.Minimum Path Sum

算法系列博客之Dynamic Programming 本篇博客将运用动态规划的思想来解决leetcode上264号问题这三个题目的共同之处在于均是二维矩阵上的规划问题问题描述:62 Unique Pa...

Leetcode62 Unique Paths

Unique Paths A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diag...

[leetcode] 62.Unique Paths

题目: A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below)...

[LeetCode]62.Unique Paths

【题目】 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram belo...

leetcode解题之62&63. Unique Paths ||64. Minimum Path Sum java版(路径(最短)可达)

leetcode解题之62&63. Unique Paths || java版(路径可达) ,63. Unique Paths II ,62. Unique Paths 。64. Minimum Pa...

LeetCode --- 62. Unique Paths

题目链接:Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the ...

算法设计Week12 LeetCode Algorithms Problem #62 Unique Paths

题目描述: A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram bel...

[leetcode] 62. Unique Paths

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

[Leetcode刷题总结系列][Dynamic Programming]62. Unique Paths

Leetcode Dynamic Programming 62. Unique Paths A robot is located at the top-left corner of a m*n gr...

LeetCode 64/62/63. Minimum Path Sum/ Unique Paths i, ii

1. 题目描述1.1 62 A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the dia...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)