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
.
扫一扫
13万+
评论
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
查看更多评论
添加红包
