xiao commit

leetcode_practice/740_leetcode.py

@@ -0,0 +1,16 @@
+class Solution:
+    def deleteAndEarn(self, nums: List[int]) -> int:
+        maxVal = max(nums)
+        total = [0] * (maxVal + 1)
+        for val in nums:
+            total[val] += val # 索引对应nums的值，值对应nums里值的和
+        # 每个房间有一定现金
+        def rob(nums: List[int]) -> int:
+            dp = [0] * len(nums)
+            dp[0] = nums[0]
+            dp[1] = max(nums[0], nums[1])
+            for i in range(2, len(nums)):
+                dp[i] = max(dp[i-2]+nums[i], dp[i-1])
+            return dp[-1]
+
+        return rob(total)