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:
1 | Input: nums = [1,2,3,1], k = 3, t = 0 |
Example 2:
1 | Input: nums = [1,0,1,1], k = 1, t = 2 |
Example 3:
1 | Input: nums = [1,5,9,1,5,9], k = 2, t = 3 |
k<1
|| t < 0
1 | class 大专栏 leetcode 220 Contains Duplicate - zerteenpan>{ |
leetcode 220 Contains Duplicate - zerteen
原文:https://www.cnblogs.com/lijianming180/p/12433000.html