Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j is at most k. 题目大意:给定一个数组,找出是否存在两个不同下标的值相差<=t,下标i和j相…