Give you two arrays of integers arr1, arr2 and an integer d, please return the distance between the two arrays.
"Distance value" is defined as the number of elements that match this description: for element arr1 [i], there is no element arr2 [j] satisfies | arr1 [i] -arr2 [j] | <= d
Example 1:
Input: arr1 = [4,5,8], arr2 = [10,9,1,8], d = 2
Output: 2
Explanation:
For arr1 [0] = 4 we have:
| 4-10 | = 6> d = 2
| 4-9 | = 5> d = 2
| 4-1 | = 3> d = 2
| 4-8 | = 4> d = 2
for arr1 [1] = 5 we have:
| 5-10 | = 5> d = 2
| 5-9 | = 4> d = 2
| 5-1 | = 4> d = 2
| 5-8 | = 3> d = 2
For arr1 [2] = 8 we have:
| 8-10 | = 2 <= d = 2
| 8-9 | = 1 <= d = 2
| 8-1 | = 7> d = 2
| 8-8 | = 0 <= d =
2Example 2:
Input: arr1 = [1,4,2,3], arr2 = [-4, -3,6,10,20,30], d = 3
Output: 2
Example 3:
Input: arr1 = [2,1,100,3], arr2 = [-5, -2,10, -3,7], d = 6
Output: 1
prompt:
1 <= arr1.length, arr2.length <= 500
-10^3 <= arr1[i], arr2[j] <= 10^3
0 <= d <= 100
Source: LeetCode (LeetCode)
Link: https://leetcode-cn.com/problems/find-the-distance-value-between-two-arrays
Copyright belongs to the deduction network. Please contact the official authorization for commercial reprint, and please indicate the source for non-commercial reprint.
Ideas:
The data size is small, just go directly to the double circular violence solution.
Time complexity: O (N ^ 2)
Space complexity: O (1)
class Solution(object):
def findTheDistanceValue(self, arr1, arr2, d):
"""
:type arr1: List[int]
:type arr2: List[int]
:type d: int
:rtype: int
"""
res = 0
for num1 in arr1:
flag = 1
for num2 in arr2:
if abs(num1 - num2) <= d:
flag = 0
break
if flag:
res += 1
return res
