From 34aabac5b93af8dcb2e56a48c8f1b9049f2a28be Mon Sep 17 00:00:00 2001
From: ZerenZhang2022 <118794589+ZerenZhang2022@users.noreply.github.com>
Date: Mon, 10 Apr 2023 00:58:56 -0400
Subject: [PATCH] =?UTF-8?q?Update=200213.=E6=89=93=E5=AE=B6=E5=8A=AB?=
 =?UTF-8?q?=E8=88=8DII.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

增加python - 二维dp数组写法
---
 problems/0213.打家劫舍II.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/problems/0213.打家劫舍II.md b/problems/0213.打家劫舍II.md
index 0627eedb..5d315d5c 100644
--- a/problems/0213.打家劫舍II.md
+++ b/problems/0213.打家劫舍II.md
@@ -142,7 +142,20 @@ class Solution:
                 dp[i]=max(dp[i-1],dp[i-2]+nums[i])
         return dp[-1]
 ```
-
+```python
+class Solution: # 二维dp数组写法
+    def rob(self, nums: List[int]) -> int:
+        if len(nums)<3: return max(nums)
+        return max(self.default(nums[:-1]),self.default(nums[1:]))
+    def default(self,nums):
+        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])
+            dp[i][1] = dp[i-1][0] + nums[i]
+        return max(dp[-1])
+        
+```
 Go：
 
 ```go