两个数组间的距离值

@author: sdubrz
@date: 2020.03.24
题目难度： 简单
考察内容：数组
原题链接 https://leetcode-cn.com/problems/find-the-distance-value-between-two-arrays/
题目的著作权归领扣网络所有，商业转载请联系官方授权，非商业转载请注明出处。
解题代码转载请联系 lwyz521604#163.com

原题的翻译得不太好，推荐直接看英文版的题目。

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

解题方法

题目的限制条件中给出了数据的范围，因而可以使用桶的方法来做。这样的时间复杂度是O(dn)的。其Java实现如下。

class Solution {
    public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
        int count = 0;
		
		int[] label = new int[2001];
		for(int i=0; i<arr2.length; i++) {
			label[arr2[i]+1000] = 1;
		}
		
		for(int i=0; i<arr1.length; i++) {
			boolean good = true;
			int left = arr1[i] + 1000 - d;
			int right = arr1[i] + 1000 + d;
			if(left < 0) {
				left = 0;
			}
			if(right > 2000) {
				right = 2000;
			}
			
			for(int j = left; j<=right; j++) {
				if(label[j]==1) {
					good = false;
					break;
				}
			}
			
			if(good) {
				count++;
			}
		}
		
		return count;
    }
}

提交之后的运行时间为2ms，内存为41.7MB，在目前已提交的Java版记录当中，均为最优。