LeetCode220 Contains Duplicate III

题目：

       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 absolutedifference 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

public class ContainsDuplicateIII {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        if(nums == null || nums.length == 0) return false;
        long limit = (long)t;

        for(int i = 0; i < nums.length; i++){
            for(int j = i + 1; j <= i + k && j < nums.length; j++){
                if(Math.abs((long)nums[i] - (long)nums[j]) <= limit)
                    return true;
            }
        }

        return false;
    }

    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 1};
        int k = 3, t = 0;
        System.out.println(new ContainsDuplicateIII().containsNearbyAlmostDuplicate(nums, k, t));
    }
}