Update 58. 打家劫舍.md

jasoncao11 · jasoncao11 · commit d02018c0536a · 2022-08-12T01:17:28.000+08:00
diff --git a/58. 打家劫舍.md b/58. 打家劫舍.md
@@ -6,7 +6,7 @@ class Solution:
         n = len(nums)
         if n<3:
             return max(nums)
-
+        #dp[i]表示截止至第i间房子所能偷窃到的最大金额
         dp = [0]*n
         dp[0] = nums[0]
         dp[1] = max(nums[:2])
