parent
ba03a17e68
commit
801e03ab31
|
|
@ -150,7 +150,17 @@ class Solution:
|
|||
dp[i] = max(dp[i-2]+nums[i], dp[i-1])
|
||||
return dp[-1]
|
||||
```
|
||||
|
||||
```python
|
||||
class Solution: # 二维dp数组写法
|
||||
def rob(self, nums: List[int]) -> int:
|
||||
dp = [[0,0] for _ in range(len(nums))]
|
||||
dp[0][1] = nums[0]
|
||||
for i in range(1,len(nums)):
|
||||
dp[i][0] = max(dp[i-1][1],dp[i-1][0])
|
||||
dp[i][1] = dp[i-1][0]+nums[i]
|
||||
print(dp)
|
||||
return max(dp[-1])
|
||||
```
|
||||
Go:
|
||||
```Go
|
||||
func rob(nums []int) int {
|
||||
|
|
|
|||
Loading…
Reference in New Issue