Skip to content

Commit 1de1f71

author

hj.tian

committed

feat: add leetcode75/day27_198.py

feat: add leetcode75/day27_198.py

1 parent e94a5fb commit 1de1f71Copy full SHA for 1de1f71

File tree

1 file changed

+40

-0

lines changed

leetcode75
- day27_198.py

1 file changed

+40

-0

lines changed

`‎leetcode75/day27_198.py`

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+# class Solution:`
	`4`	`+# def rob(self, nums: List[int]) -> int:`
	`5`	`+# """`
	`6`	`+# 2 7 9 3 1`
	`7`	`+`
	`8`	`+# 2`
	`9`	`+# 7`
	`10`	`+# max(2+9,7)`
	`11`	`+# 不取9,取9`
	`12`	`+# """`
	`13`	`+# # dp[i]: 0-i 所能获得的最大金钱`
	`14`	`+# # dp[i] = max(dp[i-2]+nums[i], dp[i-1])`
	`15`	`+# if len(nums) <= 1:`
	`16`	`+# return nums[0]`
	`17`	`+# dp = [0 for _ in nums]`
	`18`	`+# dp[0] = nums[0]`
	`19`	`+# dp[1] = max(nums[0], nums[1])`
	`20`	`+# for i in range(2, len(nums)):`
	`21`	`+# dp[i] = max(dp[i - 2] + nums[i], dp[i - 1])`
	`22`	`+# return dp[len(nums) - 1]`
	`23`	`+`
	`24`	`+`
	`25`	`+class Solution:`
	`26`	`+ def rob(self, nums: List[int]) -> int:`
	`27`	`+ if len(nums) <= 1:`
	`28`	`+ return nums[0]`
	`29`	`+ # 状态压缩`
	`30`	`+ dp_0 = nums[0]`
	`31`	`+ dp_1 = max(nums[0], nums[1])`
	`32`	`+ for i in range(2, len(nums)):`
	`33`	`+ dp_0, dp_1 = dp_1, max(dp_0 + nums[i], dp_1)`
	`34`	`+ return dp_1`
	`35`	`+`
	`36`	`+`
	`37`	`+if __name__ == "__main__":`
	`38`	`+ assert Solution().rob([1]) == 1`
	`39`	`+ assert Solution().rob([1, 2, 3, 1]) == 4`
	`40`	`+ assert Solution().rob([2, 7, 9, 3, 1]) == 12`

0 commit comments

Comments

(0)