# coding=utf-8
import unittest

"""220. Contains Duplicate III
https://leetcode.com/problems/contains-duplicate-iii/description/

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:**

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

**Example 2:**

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

**Example 3:**

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


Similar Questions:
  Contains Duplicate (contains-duplicate)
  Contains Duplicate II (contains-duplicate-ii)
"""


class Solution(object):
    def containsNearbyAlmostDuplicate(self, nums, k, t):
        """
        :type nums: List[int]
        :type k: int
        :type t: int
        :rtype: bool
        """
        

    def test(self):
        pass


if __name__ == "__main__":
    unittest.main()
