Просмотр исходного текста страницы Конин Георгий/contains-duplicate-iii

== Задача ==
* [[Leetcode/contains-duplicate-iii]]

== Код ==
<source lang="python">
class Solution:
    class Solution:
    def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:
        seen = {}
        for i, x in enumerate(nums): 
            b = x//(valueDiff+1)
            if b in seen and i - seen[b][0] <= indexDiff:
                return True 
            if b-1 in seen and i - seen[b-1][0] <= indexDiff and abs(x - seen[b-1][1]) <= valueDiff: 
                return True 
            if b+1 in seen and i - seen[b+1][0] <= indexDiff and abs(x - seen[b+1][1]) <= valueDiff: 
                return True 
            seen[b] = (i, x) 
        return False 
</source>

== Submission ==

https://leetcode.com/problems/contains-duplicate-iii/submissions/1439291511/


[[Участник:StasFomin|StasFomin]] 02:21, 6 ноября 2024 (UTC): {{BadStyle}}