mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
45 lines
1.5 KiB
HTML
45 lines
1.5 KiB
HTML
<p>给你一个整数数组 <code>nums</code> 和两个整数 <code>indexDiff</code> 和 <code>valueDiff</code> 。</p>
|
||
|
||
<p>找出满足下述条件的下标对 <code>(i, j)</code>：</p>
|
||
|
||
<ul>
|
||
<li><code>i != j</code>,</li>
|
||
<li><code>abs(i - j) <= indexDiff</code></li>
|
||
<li><code>abs(nums[i] - nums[j]) <= valueDiff</code></li>
|
||
</ul>
|
||
|
||
<p>如果存在，返回 <code>true</code><em> ；</em>否则，返回<em> </em><code>false</code><em> </em>。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong class="example">示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [1,2,3,1], indexDiff = 3, valueDiff = 0
|
||
<strong>输出：</strong>true
|
||
<strong>解释：</strong>可以找出 (i, j) = (0, 3) 。
|
||
满足下述 3 个条件：
|
||
i != j --> 0 != 3
|
||
abs(i - j) <= indexDiff --> abs(0 - 3) <= 3
|
||
abs(nums[i] - nums[j]) <= valueDiff --> abs(1 - 1) <= 0
|
||
</pre>
|
||
|
||
<p><strong class="example">示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [1,5,9,1,5,9], indexDiff = 2, valueDiff = 3
|
||
<strong>输出：</strong>false
|
||
<strong>解释：</strong>尝试所有可能的下标对 (i, j) ，均无法满足这 3 个条件，因此返回 false 。
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>2 <= nums.length <= 10<sup>5</sup></code></li>
|
||
<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>
|
||
<li><code>1 <= indexDiff <= nums.length</code></li>
|
||
<li><code>0 <= valueDiff <= 10<sup>9</sup></code></li>
|
||
</ul>
|