[swift] 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).

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.

func uniquePaths(_ m: Int, _ n: Int) -> Int {pathMatrix = Array(repeating: Array(repeating: 0, count: n+1), count: m+1)return pathMatrix(m, n)
}private var pathMatrix: [[Int]]!
private func pathMatrix(_ m: Int, _ n: Int) -> Int {if m <= 0 || n <= 0 { return 0 }if m < 2 || n < 2 { pathMatrix[m][n] = 1; return 1 }if pathMatrix[m-1][n] == 0 {pathMatrix[m-1][n] = pathMatrix(m-1, n)}if pathMatrix[m][n-1] == 0 {pathMatrix[m][n-1] = pathMatrix(m, n-1)}return pathMatrix[m-1][n] + pathMatrix[m][n-1]
}

[swift] LeetCode 62. Unique Paths相关推荐

【动态规划】LeetCode 62. Unique Paths
LeetCode 62. Unique Paths Solution1:我的未能AC的答案递归超时了!!! class Solution { public:int uniquePaths(int m ...
[Leetcode]62. Unique Paths
62. Unique Paths 本题难度: Easy Topic: Dynamic Programming Description A robot is located at the top-lef ...
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 below). ...
[leetcode] 62 Unique Paths (Medium)
原题链接字母题 : unique paths Ⅱ 思路: dp[i][j]保存走到第i,j格共有几种走法. 因为只能走→或者↓,所以边界条件dp[0][j]+=dp[0][j-1] 同时容易得出递推 ...
[dp] LeetCode 62. Unique Paths
输入:两个int m和n 输出:一个int,表示不同路径的个数. 规则:有一个m行n列的矩阵,一个机器人从左上角走到右下角,每次向下或者向右走一格. 分析:目的是要找到从(0,0)到(m-1,n-1) ...
[Lintcode]115. Unique Paths II/[Leetcode]63. Unique Paths II
115. Unique Paths II/63. Unique Paths II 本题难度: Easy/Medium Topic: Dynamic Programming Description Fo ...
【动态规划】LeetCode 63. Unique Paths II
LeetCode 63. Unique Paths II Solution1:我的答案在哪里做过这题? class Solution { public:int uniquePathsWithObst ...
[LeetCode]--63. Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How m ...

[swift] LeetCode 62. Unique Paths

[swift] LeetCode 62. Unique Paths相关推荐

最新文章

热门文章