Leetcode 220. duplicate element III exists

Give you an array of integers nums And two integers k and t . Please judge whether there is Two different subscripts i and j, bring abs(nums[i] - nums[j]) <= t , At the same time, they are satisfied with abs(i - j) <= k .

Return if present true, There is no return false.

Example 1：

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