From 30f2c6bc1763bb3cfe607707f96b1d9047a3d2b3 Mon Sep 17 00:00:00 2001
From: Verolilo <57696907+Verolilo@users.noreply.github.com>
Date: Mon, 14 Feb 2022 14:15:33 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=9B=B4=E6=96=B00070.=E7=88=AC=E6=A5=BC?=
 =?UTF-8?q?=E6=A2=AF.md=20python=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

更新0070.爬楼梯.md python版本，添加了O(1)复杂度的python代码
---
 problems/0070.爬楼梯.md | 28 ++++++++++++++++++++--------
 1 file changed, 20 insertions(+), 8 deletions(-)

diff --git a/problems/0070.爬楼梯.md b/problems/0070.爬楼梯.md
index 7f47a991..da19ea0e 100644
--- a/problems/0070.爬楼梯.md
+++ b/problems/0070.爬楼梯.md
@@ -256,16 +256,28 @@ public int climbStairs(int n) {
 ### Python
 
 ```python
+# 空间复杂度为O(n)版本
 class Solution:
     def climbStairs(self, n: int) -> int:
-        # dp[i]表示爬到第i级楼梯的种数， (1, 2) (2, 1)是两种不同的类型
-        dp = [0] * (n + 1)
-        dp[0] = 1
-        for i in range(n+1):
-            for j in range(1, 3):
-                if i>=j:
-                    dp[i] += dp[i-j]
-        return dp[-1]
+        # dp[i] 为第 i 阶楼梯有多少种方法爬到楼顶
+        dp=[0]*(n+1)
+        dp[0]=1
+        dp[1]=1
+        for i in range(2,n+1):
+            dp[i]=dp[i-1]+dp[i-2]
+        return dp[n]
+        
+# 空间复杂度为O(1)版本
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        dp=[0]*(n+1)
+        dp[0]=1
+        dp[1]=1
+        for i in range(2,n+1):
+            tmp=dp[0]+dp[1]
+            dp[0]=dp[1]
+            dp[1]=tmp
+        return dp[1]
 ```
 
 ### Go 

From 6d5a0d0340798f773104f418d3db71797c5db717 Mon Sep 17 00:00:00 2001
From: Verolilo <57696907+Verolilo@users.noreply.github.com>
Date: Wed, 16 Feb 2022 10:22:19 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=9B=B4=E6=96=B00213.=E6=89=93=E5=AE=B6?=
 =?UTF-8?q?=E5=8A=AB=E8=88=8DII.md=20=E6=9B=B4=E7=AE=80=E6=B4=81=E7=9A=84p?=
 =?UTF-8?q?ython=20=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0213.打家劫舍II.md | 32 +++++++++++++++++---------------
 1 file changed, 17 insertions(+), 15 deletions(-)

diff --git a/problems/0213.打家劫舍II.md b/problems/0213.打家劫舍II.md
index b6c2d080..8e569e46 100644
--- a/problems/0213.打家劫舍II.md
+++ b/problems/0213.打家劫舍II.md
@@ -123,22 +123,24 @@ Python：
 ```Python
 class Solution:
     def rob(self, nums: List[int]) -> int:
-      if (n := len(nums)) == 0:
-        return 0
-      if n == 1:
-        return nums[0]
-      result1 = self.robRange(nums, 0, n - 2)
-      result2 = self.robRange(nums, 1, n - 1)
-      return max(result1 , result2)
+        #在198入门级的打家劫舍问题上分两种情况考虑
+        #一是不偷第一间房，二是不偷最后一间房
+        if len(nums)==1:#题目中提示nums.length>=1,所以不需要考虑len(nums)==0的情况
+            return nums[0]
+        val1=self.roblist(nums[1:])#不偷第一间房
+        val2=self.roblist(nums[:-1])#不偷最后一间房
+        return max(val1,val2)
 
-    def robRange(self, nums: List[int], start: int, end: int) -> int:
-      if end == start: return nums[start]
-      dp = [0] * len(nums)
-      dp[start] = nums[start]
-      dp[start + 1] = max(nums[start], nums[start + 1])
-      for i in range(start + 2, end + 1):
-        dp[i] = max(dp[i -2] + nums[i], dp[i - 1])
-      return dp[end]
+    def robRange(self,nums):
+        l=len(nums)
+        dp=[0]*l
+        dp[0]=nums[0]
+        for i in range(1,l):
+            if i==1:
+                dp[i]=max(dp[i-1],nums[i])
+            else:
+                dp[i]=max(dp[i-1],dp[i-2]+nums[i])
+        return dp[-1]
 ```
 
 javascipt: