#2426

Number of Pairs Satisfying Inequality

candidate master · 1510 · lc hard +32 · failed · 46.9% accepted · 577 likes · top 31%

Description

You are given two 0-indexed integer arrays nums1 and nums2, each of length n, and an integer diff.

Count and return the number of pairs (i, j) with 0 <= i < j <= n - 1 such that nums1[i] - nums1[j] <= nums2[i] - nums2[j] + diff.

Example 1:

Input: nums1 = [3,2,5], nums2 = [2,2,1], diff = 1

Output: 3

Explanation:

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.

Example 2:

Input: nums1 = [3,-1], nums2 = [-2,2], diff = -1

Output: 0

Explanation:

Since there does not exist any pair that satisfies the conditions, we return 0.

Code

1

2

3

class Solution:
    def numberOfPairs(self, nums1: List[int], nums2: List[int], diff: int) -> int:

class Solution:
    def numberOfPairs(self, nums1: List[int], nums2: List[int], diff: int) -> int: