Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 740 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 740 # by problem number
lcpy gen -s delete_and_earn # by problem name
nums. You want to maximize the number of points you get by performing the following operation any number of times:
nums[i] and delete it to earn nums[i] points. Afterwards, you must delete every element equal to nums[i] - 1 and every element equal to nums[i] + 1.Input: nums = [3,4,2]
Output: 6
Explanation: You can perform the following operations:
- Delete 4 to earn 4 points. Consequently, 3 is also deleted. nums = [2].
- Delete 2 to earn 2 points. nums = [].
You earn a total of 6 points.
Input: nums = [2,2,3,3,3,4]
Output: 9
Explanation: You can perform the following operations:
- Delete a 3 to earn 3 points. All 2's and 4's are also deleted. nums = [3,3].
- Delete a 3 again to earn 3 points. nums = [3].
- Delete a 3 once more to earn 3 points. nums = [].
You earn a total of 9 points.
from collections import Counter
class Solution:
# Reduces to house robber over consecutive value runs
# Time: O(n + m log m) where m = number of distinct values
# Space: O(m)
def delete_and_earn(self, nums: list[int]) -> int:
counts = Counter(nums)
take = skip = 0
previous = None
for value in sorted(counts):
gain = value * counts[value]
if previous == value - 1:
take, skip = skip + gain, max(take, skip)
else:
take, skip = max(take, skip) + gain, max(take, skip)
previous = value
return max(take, skip)
| Time | Space |
|---|---|
| O(n + m log m) where m = number of distinct values | O(m) |