每日leetcode4.19-移除元素

27.移除元素

思路和之前一道去重的提较为类似

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        i = 0
        j = 0
        while j < len(nums):
            if nums[j] != val:
                nums[i] = nums[j]
                i += 1
            j += 1
        print(nums)
        return i

220.存在重复元素 III

用桶排序原理，时间复杂度较低

class Solution:
    def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:
        mp = {}
        i = 0
        j = 0
        l = len(nums)
        while j < l and j <= k:
            if (nums[j] // (t + 1)) in mp or (
                    (nums[j] // (t + 1) - 1) in mp and abs(mp[nums[j] // (t + 1) - 1] - nums[j]) <= t) or (
                    (nums[j] // (t + 1) + 1) in mp and abs(mp[nums[j] // (t + 1) + 1] - nums[j]) <= t):
                return True
            mp[nums[j] // (t + 1)] = nums[j]
            j += 1
        while j < l:
            del mp[nums[i] // (t + 1)]
            if (nums[j] // (t + 1)) in mp or (
                    (nums[j] // (t + 1) - 1) in mp and abs(mp[nums[j] // (t + 1) - 1] - nums[j]) <= t) or (
                    (nums[j] // (t + 1) + 1) in mp and abs(mp[nums[j] // (t + 1) + 1] - nums[j]) <= t):
                return True
            mp[nums[j] // (t + 1)] = nums[j]
            j += 1
            i += 1
        return False

其次，本题用py优先队列并不能解，因为优先队列删除制定元素复杂度并不低，本题用c++底层的红黑树，set有序集合，可以实现指定元素的删除