g0201_0300.s0220_contains_duplicate_iii

Class Solution

java.lang.Object

g0201_0300.s0220_contains_duplicate_iii.Solution

public class Solution
extends Object

220 - Contains Duplicate III.

Medium

Given an integer array nums and two integers k and t, return true if there are two distinct indices i and j in the array such that abs(nums[i] - nums[j]) <= t and abs(i - j) <= 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

Constraints:

• 1 <= nums.length <= 2 * 104
• -231 <= nums[i] <= 231 - 1
• 0 <= k <= 104
• 0 <= t <= 231 - 1

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
boolean	containsNearbyAlmostDuplicate(int[] nums, int k, int t)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

containsNearbyAlmostDuplicate

public boolean containsNearbyAlmostDuplicate(int[] nums,
                                             int k,
                                             int t)