LeetCode 1385. Find the Distance Value Between Two Arrays

題目：
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.

範例：

Input: arr1 = [4,5,8], arr2 = [10,9,1,8], d = 2Output: 2Explanation: 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=2For 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

解法：
找出在arr1[i]，不滿足arr[i]-arr2[j]的距離<=d的有幾組
我先算arr1的長度，然後減去滿足arr[i]-arr2[j]的距離<=d的組數
這樣可以在一算到滿足arr[i]-arr2[j]的距離<=d的條件就跳出arr2的迴圈

func findTheDistanceValue(arr1 []int, arr2 []int, d int) int {
    count := len(arr1)
    for _, i := range arr1 {
        for _, j := range arr2{
            if int(math.Abs(float64(i-j))) <= d {
                count--
                break
            }
        }
    }
    return count
}