My solution fails on this case
why it should return false?
In the problem description,
the difference between nums[i] and nums[j] is at most t
That means, abs( nums[i] - nums[j] ) <= t, which must be bigger than or equal to 0.
abs( nums[i] - nums[j] ) <= t
It is very confusing to me too. I think it just mean to reject no matter what as long as t < 0.
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.