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

2

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

Output: true

Example 2:

1

2

Input: nums = [1,0,1,1], k = 1, t = 2

Output: true

Example 3:

1

2

Input: nums = [1,5,9,1,5,9], k = 2, t = 3

Output: false

Solution

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

classSolution {

public:

boolcontainsNearbyAlmostDuplicate(vector<int>& nums, int k, int t){