[Swift]LeetCode220. 存在重复元素 III | Contains Duplicate III

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10202984.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i]and nums[j] is at most t and the absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3, t = 0
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1, t = 2
Output: true

Example 3:

Input: nums = [1,5,9,1,5,9], k = 2, t = 3
Output: false

---

给定一个整数数组，判断数组中是否有两个不同的索引 i 和 j，使得 nums [i] 和 nums [j] 的差的绝对值最大为 t，并且 i 和 j 之间的差的绝对值最大为 ķ。

示例 1:

输入: nums = [1,2,3,1], k= 3, t = 0
输出: true

示例 2:

输入: nums = [1,0,1,1], k=1, t = 2
输出: true

示例 3:

输入: nums = [1,5,9,1,5,9], k = 2, t = 3
输出: false

---

52ms

class Solution {
    func containsNearbyAlmostDuplicate(_ nums: [Int], _ k: Int, _ t: Int) -> Bool {
        var set: Set<Int> = []
        for (index, num) in nums.enumerated() {
            if t == 0 {
                if set.contains(num) {
                    return true
                }
            } else {
                if set.contains(where: { abs($0 - num) <= t }) {
                    return true
                }
            }

            set.insert(num)

            if index >= k {
                set.remove(nums[index - k])
            }
        }

        return false
    }
}

---

60ms

class Solution {
    func containsNearbyAlmostDuplicate(_ nums: [Int], _ k: Int, _ t: Int) -> Bool {
        if nums.isEmpty || nums.count < 2 {
            return false
        }
        var indices = [Int](0 ..< nums.count)
        indices = indices.sorted(by: { a, b in nums[a] < nums[b] } )
        
        for i in 0 ..< nums.count {
            var x = indices[i]
            for j in (i + 1) ..< nums.count {
                var y = indices[j]
                var diffNums = nums[y] - nums[x]
                var diffIndex = abs(x - y)
                if diffNums > t {
                     break
                }
                if diffIndex <= k {
                    return true
                }
            }
        }
        return false
    }
}

---

88ms

class Solution {
    func containsNearbyAlmostDuplicate(_ nums: [Int], _ k: Int, _ t: Int) -> Bool {
        if nums.count <= 1 || k < 1 || t < 0 {
            return false
        }
        
        let mins = nums.min()!
        var bucktes = [Int : Int]()
        for i in 0..<nums.count {
            if i > k {
                let key = (nums[i-k-1] - mins) / (t+1)
                bucktes.removeValue(forKey: key)
            }
            let key = (nums[i] - mins) / (t + 1)
            if bucktes.keys.contains(key) {
                return true
            }
            if let left = bucktes[key-1] , nums[i] - left <= t {
                return true
            }
            if let right = bucktes[key+1], right - nums[i] <= t {
                return true
            }
            bucktes[key] = nums[i]
        }
        
        return false
    }
}