Contains Duplicate III LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @param {number} k
4
 * @param {number} t
5
 * @return {boolean}
6
 */
7
var containsNearbyAlmostDuplicate = function (nums, k, t) {
8
  for (let i = 0; i < nums.length; i++) {
9
    for (let j = i + 1; j < nums.length; j++) {
10
      if (Math.abs(nums[i] - nums[j]) <= t && Math.abs(i - j) <= k) {
11
        return true;
12
      }
13
    }
14
  }
15
  return false;
16
};