# 题目

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=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=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=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
-10^3 <= arr1[i], arr2[j] <= 10^3
0 <= d <= 100```

# 分析

```class Solution {
public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
for(int i=0;i<arr1.length;++i){
for(int j=0;j<arr2.length;++j){
if(Math.abs(arr1[i]-arr2[j])<=d)
return i;
}
}
return -1;
}
}```

```class Solution {
public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
int res = 0;
for (int i = 0; i < arr1.length; i++) {
boolean pass = true;
for (int j = 0; j < arr2.length; j++) {
if (Math.abs(arr1[i] - arr2[j]) <= d) {
pass = false;
break;
}
}
if (pass) res++;
}
return res;
}
}```

# 解答

0 条评论

• ### Array Broadcasting in Numpy

Let’s explore a more advanced concept in numpy called broadcasting. The term bro...

• ### LeetCode Weekly Contest 37解题思路

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.n...

• ### Hierarchical clustering and dimension reduction

Lecture 8: Hierarchical clustering and dimension reduction

• ### Face_Recognition_v3a

In this assignment, you will build a face recognition system. Many of the ideas ...

• ### SIFT特征检测（一）

（还没推完公式先贴上matlab和c的代码 from官方文档） 因为官方的shift.m直接跑起来会出问题。我这儿改良了部分代码 改sift.m % [ima...

• ### Predicting the Future V2更新

Predicting the Future with Multi-scale Successor Representations

• ### Operations_on_word_vectors_v2a

Welcome to your first assignment of this week!

• ### Classification and regression techniques: decision tree and knn

Lectures 12 and 13: Classification and regression techniques: decision tree and ...

• ### 3.1.2 使用绘图API绘制Contour的思路

A week or so back I wrote about a package I ported/modified to create the Delaun...

• ###  7种常见数据结构的图画解读

Data structures are fundamental constructs that are used to build programs. Each...

• ### Assessing correlations

-be able to explain why identifying correlations is useful for data wrangling/an...

• ### LeetCode 973 K Closest Points to Origin

We have a list of points on the plane. Find the K closest points to the origin ...

• ### 2020年跳槽最好不要去的公司 Baozi Leetcode solution 229: Major Element II

新年新气象，很多同学们都跃跃欲试，老司机会告诉你，人生苦短，何妨一试？不过如果仅仅是为了尝试而尝试，那么无论尝试了多少最终都只不过是量的积累而没有质的飞跃。要钱...

• ### Code Forces Bear and Forgotten Tree 3 639B

B. Bear and Forgotten Tree 3 time limit per test2 seconds memory limit per t...

• ### Finding the closest objects in the feature space在特征空间中找到最接近的对象

Sometimes, the easiest thing to do is to just find the distance between two obje...

• ### HDU 1512 - Monkey King

Once in a forest, there lived N aggressive monkeys. At the beginning, they each ...

• ### POJ 1985 Cow Marathon(树的直径)

Description After hearing about the epidemic of obesity in the USA, Farmer John...

• ### 868. Binary Gap

Given a positive integer N, find and return the longest distance between two con...

### 活动推荐 