Commit e40e346

committed

🐱(dynamic): 740. 删除与获得点数

1 parent e3d5cdd commit e40e346Copy full SHA for e40e346

File tree

+40

-0

lines changed

+40

-0

lines changed

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -769,6 +769,46 @@ class Solution(object):`
`769`	`769`	`return cash`
`770`	`770`	```
`771`	`771`
	`772`	`+## 740. 删除与获得点数`
	`773`	`+`
	`774`	`+[原题链接](https://leetcode-cn.com/problems/delete-and-earn/)`
	`775`	`+`
	`776`	`+### 思路`
	`777`	`+`
	`778`	`+太困了,题解明天补充。`
	`779`	`+`
	`780`	+```python
	`781`	`+class Solution:`
	`782`	`+ def deleteAndEarn(self, nums: List[int]) -> int:`
	`783`	`+ if len(nums) == 0:`
	`784`	`+ return 0`
	`785`	`+ nums_map = dict()`
	`786`	`+ for num in nums:`
	`787`	`+ nums_map[num] = nums_map.get(num, 0) + 1`
	`788`	`+ # 去重 + 排序`
	`789`	`+ nums_list = sorted(list(set(nums)))`
	`790`	`+ dp = dict()`
	`791`	`+ dp[nums_list[0]] = nums_list[0] * nums_map[nums_list[0]]`
	`792`	`+`
	`793`	`+ for i in range(1, len(nums_list)):`
	`794`	`+ num = nums_list[i]`
	`795`	`+ points = nums_map.get(num, 0) * num`
	`796`	`+ pre_num = nums_list[i - 1]`
	`797`	`+ if i == 1:`
	`798`	`+ if pre_num == num - 1:`
	`799`	`+ dp[num] = max(dp[pre_num], points)`
	`800`	`+ else:`
	`801`	`+ dp[num] = dp[pre_num] + points`
	`802`	`+ else:`
	`803`	`+ ppre_num = nums_list[i - 2]`
	`804`	`+ if pre_num == num - 1:`
	`805`	`+ dp[num] = max(dp.get(ppre_num, 0) + nums_map.get(num, 0) * num, dp.get(pre_num, 0))`
	`806`	`+ else:`
	`807`	`+ dp[num] = dp[pre_num] + points`
	`808`	`+`
	`809`	`+ return dp[nums_list[-1]]`
	`810`	+```
	`811`	`+`
`772`	`812`	`## 898. 子数组按位或操作`
`773`	`813`
`774`	`814`	`[原题链接](https://leetcode-cn.com/problems/bitwise-ors-of-subarrays/)`

Comments

(0)