Leetcode 220. 存在重复元素 III(Python3)

220. 存在重复元素 III

给定一个整数数组，判断数组中是否有两个不同的索引 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

---

暴力法：

class Solution:
    def containsNearbyAlmostDuplicate(self, nums, k, t):
        """
        :type nums: List[int]
        :type k: int
        :type t: int
        :rtype: bool
        """
        length = len(nums)
        if t == 0 and len(set(nums)) == length: return False
        for i in range(length):
            for j in range(i+1,length):
                if j - i <= k and abs(nums[i]-nums[j]) <= t: 
                    return True
        return False

---

剪枝优化下：

class Solution:
    def containsNearbyAlmostDuplicate(self, nums, k, t):
        """
        :type nums: List[int]
        :type k: int
        :type t: int
        :rtype: bool
        """
        length = len(nums)
        if t == 0 and len(set(nums)) == length: return False
        for i in range(length):
            for j in range(i+1,length):
                if j - i <= k:
                    if abs(nums[i]-nums[j]) <= t: return True
                else: break
        return False