mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Deven
16 lines
405 B
Python
16 lines
405 B
Python
class Solution:
|
|
def rob(self, nums: List[int]) -> int:
|
|
n = len(nums)
|
|
dp = [0] * n
|
|
|
|
if n >= 1:
|
|
dp[0] = nums[0]
|
|
if n >= 2:
|
|
dp[1] = max(nums[0], nums[1])
|
|
if n >= 3:
|
|
dp[2] = max(nums[0] + nums[2], nums[1])
|
|
|
|
for i in range(3, n):
|
|
dp[i] = max(nums[i] + dp[i - 2], nums[i - 1] + dp[i - 3])
|
|
|
|
return dp[-1] |