Movatterモバイル変換

Skip to content

sahasourav17/neetcode-leetcodePublic

forked fromneetcode-gh/leetcode

NotificationsYou must be signed in to change notification settings
Fork0
Star0

Commit28b86f8

a93a

authored

Update 0045-jump-game-ii.kt

1 parent7fa5229 commit28b86f8Copy full SHA for 28b86f8

File tree

1 file changed

+33

-1

lines changed

kotlin
- 0045-jump-game-ii.kt

1 file changed

+33

-1

lines changed

`‎kotlin/0045-jump-game-ii.kt‎`

Lines changed: 33 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,6 @@`
	`1`	`+/*`
	`2`	`+* O(n) BFS`
	`3`	`+*/`
`1`	`4`	`classSolution {`
`2`	`5`	`funjump(nums:IntArray):Int {`
`3`	`6`	`var left=0`
`@@ -15,4 +18,33 @@ class Solution {`
`15`	`18`	`}`
`16`	`19`	`return res`
`17`	`20`	`}`
`18`		`-}`
	`21`	`+}`
	`22`	`+`
	`23`	`+/*`
	`24`	`+* O(N^2) DP + memoization`
	`25`	`+*/`
	`26`	`+classSolution {`
	`27`	`+funjump(nums:IntArray):Int {`
	`28`	`+val dp=IntArray(nums.size) {10001 }`
	`29`	`+`
	`30`	`+funjump(i:Int):Int {`
	`31`	`+if (i== nums.lastIndex)`
	`32`	`+return0`
	`33`	`+if (dp[i]!=10001)`
	`34`	`+return dp[i]`
	`35`	`+`
	`36`	`+for (stepsin1..nums[i]) {`
	`37`	`+if (i+ steps<= nums.lastIndex) {`
	`38`	`+ dp[i]= minOf(`
	`39`	`+ dp[i],`
	`40`	`+1+ jump(i+ steps)`
	`41`	`+ )`
	`42`	`+ }`
	`43`	`+ }`
	`44`	`+`
	`45`	`+return dp[i]`
	`46`	`+ }`
	`47`	`+`
	`48`	`+return jump(0)`
	`49`	`+ }`
	`50`	`+}`

0 commit comments

Comments

(0)

[8]ページ先頭

©2009-2025 Movatter.jp