Contains Duplicate III LeetCode solution in Python

1
# Runtime: 779 ms (Top 16.27%) | Memory: 17.7 MB (Top 35.86%)
2
from sortedcontainers import SortedList
3

4

5
class Solution:
6
    def containsNearbyAlmostDuplicate(self, nums, k, t):
7
        sl = SortedList()
8
        for i in range(len(nums)):
9
            if i > k:
10
                sl.remove(nums[i - k - 1])
11
            idxl = sl.bisect_left(nums[i] - t)
12
            idxr = sl.bisect_right(nums[i] + t)
13
            if idxl != idxr:
14
                return True
15
            sl.add(nums[i])
16
        return False