mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
42 lines
1.7 KiB
HTML
42 lines
1.7 KiB
HTML
<p>You are given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, each of size <code>n</code>, and an integer <code>diff</code>. Find the number of <strong>pairs</strong> <code>(i, j)</code> such that:</p>
|
|
|
|
<ul>
|
|
<li><code>0 <= i < j <= n - 1</code> <strong>and</strong></li>
|
|
<li><code>nums1[i] - nums1[j] <= nums2[i] - nums2[j] + diff</code>.</li>
|
|
</ul>
|
|
|
|
<p>Return<em> the <strong>number of pairs</strong> that satisfy the conditions.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [3,2,5], nums2 = [2,2,1], diff = 1
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong>
|
|
There are 3 pairs that satisfy the conditions:
|
|
1. i = 0, j = 1: 3 - 2 <= 2 - 2 + 1. Since i < j and 1 <= 1, this pair satisfies the conditions.
|
|
2. i = 0, j = 2: 3 - 5 <= 2 - 1 + 1. Since i < j and -2 <= 2, this pair satisfies the conditions.
|
|
3. i = 1, j = 2: 2 - 5 <= 2 - 1 + 1. Since i < j and -3 <= 2, this pair satisfies the conditions.
|
|
Therefore, we return 3.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [3,-1], nums2 = [-2,2], diff = -1
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong>
|
|
Since there does not exist any pair that satisfies the conditions, we return 0.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == nums1.length == nums2.length</code></li>
|
|
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
|
<li><code>-10<sup>4</sup> <= nums1[i], nums2[i] <= 10<sup>4</sup></code></li>
|
|
<li><code>-10<sup>4</sup> <= diff <= 10<sup>4</sup></code></li>
|
|
</ul>
|