Class Solution

java.lang.Object
g0201_0300.s0220_contains_duplicate_iii.Solution

public class Solution extends Object
220 - Contains Duplicate III.<p>Medium</p> <p>Given an integer array <code>nums</code> and two integers <code>k</code> and <code>t</code>, return <code>true</code> if there are <strong>two distinct indices</strong> <code>i</code> and <code>j</code> in the array such that <code>abs(nums[i] - nums[j]) <= t</code> and <code>abs(i - j) <= k</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,1], k = 3, t = 0</p> <p><strong>Output:</strong> true</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,0,1,1], k = 1, t = 2</p> <p><strong>Output:</strong> true</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,5,9,1,5,9], k = 2, t = 3</p> <p><strong>Output:</strong> false</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 2 * 10<sup>4</sup></code></li> <li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li> <li><code>0 <= k <= 10<sup>4</sup></code></li> <li><code>0 <= t <= 2<sup>31</sup> - 1</code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • containsNearbyAlmostDuplicate

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