-
Notifications
You must be signed in to change notification settings - Fork 0
/
220.contains-duplicate-iii.py
46 lines (32 loc) · 1.08 KB
/
220.contains-duplicate-iii.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#
# @lc app=leetcode id=220 lang=python3
#
# [220] Contains Duplicate III
#
# @lc code=start
from typing import OrderedDict
class Solution:
def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:
# limit1:
# |j−i|<=k
# limit2:
# |nums[j]−nums[i]|<=t
# ⟺ |nums[j]/t−nums[i]/t|<=1
# ⟺ ⌊nums[j]/t⌋∈ {⌊nums[i]/t⌋−1,⌊nums[i]/t⌋,⌊nums[i]/t⌋+1}
# sanity check
if k < 1 or t < 0:
return False
# OrderedDict is needed to popitem() with FIFO,
# albeit dict after Python 3.7 is ordered FIFO by default
dic = OrderedDict()
for num in nums:
key = num if t == 0 else num // t
for m in (dic.get(key - 1), dic.get(key), dic.get(key + 1)):
if m is not None and abs(num - m) <= t:
return True
# overdistanced, need to ignore previous items
if len(dic) == k:
dic.popitem(last=False)
dic[key] = num
return False
# @lc code=end