Commit 163f372

authored

feat: add swift implementation to lcof2 problem: No.100 (doocs#3506)

1 parent 399f853 commit 163f372Copy full SHA for 163f372

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -155,6 +155,25 @@ class Solution:`
`155`	`155`	`return dp[0]`
`156`	`156`	```
`157`	`157`
	`158`	`+#### Swift`
	`159`	`+`
	`160`	+```swift
	`161`	`+class Solution {`
	`162`	`+ func minimumTotal(_ triangle: [[Int]]) -> Int {`
	`163`	`+ let n = triangle.count`
	`164`	`+ var dp = Array(repeating: 0, count: n + 1)`
	`165`	`+`
	`166`	`+ for i in (0..<n).reversed() {`
	`167`	`+ for j in 0...i {`
	`168`	`+ dp[j] = min(dp[j], dp[j + 1]) + triangle[i][j]`
	`169`	`+ }`
	`170`	`+ }`
	`171`	`+`
	`172`	`+ return dp[0]`
	`173`	`+ }`
	`174`	`+}`
	`175`	+```
	`176`	`+`
`158`	`177`	`<!-- tabs:end -->`
`159`	`178`
`160`	`179`	`<!-- solution:end -->`

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,14 @@`
	`1`	`+class Solution {`
	`2`	`+ func minimumTotal(_ triangle: [[Int]]) -> Int {`
	`3`	`+ let n = triangle.count`
	`4`	`+ var dp = Array(repeating: 0, count: n + 1)`
	`5`	`+`
	`6`	`+ for i in (0..<n).reversed() {`
	`7`	`+ for j in 0...i {`
	`8`	`+ dp[j] = min(dp[j], dp[j + 1]) + triangle[i][j]`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+`
	`12`	`+ return dp[0]`
	`13`	`+ }`
	`14`	`+}`

Comments

(0)