LeetCode 1385. Find the Distance Value Between Two Arrays Solution in Java, C++, Python & More | Explanation + Code

Description

Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays.

The distance value is defined as the number of elements arr1[i] such that there is not any element arr2[j] where |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=2

Example 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

 

Constraints:

• 1 <= arr1.length, arr2.length <= 500
• -1000 <= arr1[i], arr2[j] <= 1000
• 0 <= d <= 100

Solutions

Solution 1: Sorting + Binary Search

We can first sort the array arr2, and then for each element x in the array arr1, use binary search to find the first element in the array arr2 that is greater than or equal to x - d. If such an element exists and is less than or equal to x + d, it does not meet the distance requirement. Otherwise, it meets the distance requirement. We count the number of elements that meet the distance requirement, which is the answer.

The time complexity is O((m + n) × log n), and the space complexity is O(log n). Here, m and n are the lengths of the arrays arr1 and arr2, respectively.

PythonJavaC++GoTypeScriptRust

class Solution: def findTheDistanceValue(self, arr1: List[int], arr2: List[int], d: int) -> int: arr2.sort() ans = 0 for x in arr1: i = bisect_left(arr2, x - d) ans += i == len(arr2) or arr2[i] > x + d return ans(code-box)

class Solution { public int findTheDistanceValue(int[] arr1, int[] arr2, int d) { Arrays.sort(arr2); int ans = 0; for (int x : arr1) { int i = Arrays.binarySearch(arr2, x - d); i = i < 0 ? -i - 1 : i; if (i == arr2.length || arr2[i] > x + d) { ++ans; } } return ans; } }(code-box)

class Solution { public: int findTheDistanceValue(vector<int>& arr1, vector<int>& arr2, int d) { ranges::sort(arr2); int ans = 0; for (int x : arr1) { auto it = ranges::lower_bound(arr2, x - d); if (it == arr2.end() || *it > x + d) { ++ans; } } return ans; } };(code-box)

func findTheDistanceValue(arr1 []int, arr2 []int, d int) (ans int) { sort.Ints(arr2) for _, x := range arr1 { i := sort.SearchInts(arr2, x-d) if i == len(arr2) || arr2[i] > x+d { ans++ } } return }(code-box)

function findTheDistanceValue(arr1: number[], arr2: number[], d: number): number { arr2.sort((a, b) => a - b); let ans: number = 0; for (const x of arr1) { const i = _.sortedIndex(arr2, x - d); if (i === arr2.length || arr2[i] > x + d) { ++ans; } } return ans; }(code-box)

impl Solution { pub fn find_the_distance_value(arr1: Vec<i32>, mut arr2: Vec<i32>, d: i32) -> i32 { arr2.sort(); let mut ans = 0; for &x in &arr1 { let i = match arr2.binary_search(&(x - d)) { Ok(j) => j, Err(j) => j, }; if i == arr2.len() || arr2[i] > x + d { ans += 1; } } ans } }(code-box)