63_Unique_Paths_II

Author: partho-maple

README.md

@@ -775,6 +775,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |59| **[1277. Count Square Submatrices with All Ones](https://tinyurl.com/y6a82a9r)** | [Python](https://tinyurl.com/wu6rdaw/1277_Count_Square_Submatrices_with_All_Ones.py), [Swift](https://tinyurl.com/wuja3c4/1277_Count_Square_Submatrices_with_All_Ones.swift)| [Must](https://tinyurl.com/y4sa8zgk) | Medium | --- |
 |60| [418. Sentence Screen Fitting](https://tinyurl.com/yhtu7lld) | [Swift](https://tinyurl.com/wuja3c4/418_Sentence_Screen_Fitting.swift)| [Art 1](https://tinyurl.com/yh4xt84c) | Medium | --- |
 |61| [1937. Maximum Number of Points with Cost](https://tinyurl.com/yhh6dmeh) | [Swift](https://tinyurl.com/wuja3c4/1937_Maximum_Number_of_Points_with_Cost.swift)| [Art 1](https://tinyurl.com/yg6hs4md) | Medium | --- |
+|61| [63. Unique Paths II](https://tinyurl.com/yjh69kzh) | [Swift](https://tinyurl.com/wuja3c4/63_Unique_Paths_II.swift)| --- | Medium | --- |
 
 
 

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/63_Unique_Paths_II.swift

@@ -0,0 +1,17 @@
+class Solution {
+ func uniquePathsWithObstacles(_ obstacleGrid: [[Int]]) -> Int {
+ var dp = Array(repeating: Array(repeating: 0, count: obstacleGrid[0].count + 1), count: obstacleGrid.count + 1)
+ for i in 0..<obstacleGrid.count {
+ for j in 0..<obstacleGrid[0].count {
+ if obstacleGrid[i][j] == 0 {
+ if i == 0 && j == 0 {
+ dp[i + 1][j + 1] = 1
+ } else {
+ dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]
+ }
+ }
+ }
+ }
+ return dp.last!.last!
+ }
+}