Leetcode 1385. Distance value between two arrays

Here are two arrays of integers arr1 , arr2 And an integer d , Please return the... Between two arrays Distance value .

「 Distance value 」 Number of elements defined as meeting this distance requirement ： For elements arr1[i] , There are no elements arr2[j] Satisfy |arr1[i]-arr2[j]| <= d .

Example 1：

 Input ：arr1 = [4,5,8], arr2 = [10,9,1,8], d = 2
 Output ：2
 explain ：
 about  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 
 therefore  arr1[0]=4  Meet the distance requirements 

 about  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
 therefore  arr1[1]=5  Also meet the distance requirements 

 about  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
 There is a distance less than or equal to  2  The situation of , Does not meet the distance requirements  

 So only  arr1[0]=4  and  arr1[1]=5  Two meet the distance requirements , The distance value is  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
 

Tips ：

1 <= arr1.length, arr2.length <= 500

• -10^3 <= arr1[i], arr2[j] <= 10^3
• 0 <= d <= 100

Code:

class Solution {
    
public:
    int findTheDistanceValue(vector<int>& arr1, vector<int>& arr2, int d) {
    
        int res=0;
	    for(int i=0;i<arr1.size();i++)
	    {
    
	        bool flag=false;
	        for(int j=0;j<arr2.size();j++)
	        {
    
	            if(abs(arr1[i]-arr2[j])<=d)
	            {
    
	                flag=true;
	                break;
	            }
	        }
	        if(!flag)
	          res++;  
	    }
	    return res;
    }
};