leetcode1385

class Solution:
    def findTheDistanceValue(self, arr1: List[int], arr2: List[int], d: int) -> int:
        n1,n2 = len(arr1),len(arr2)
        result = 0
        for i in range(n1):
            cur1 = arr1[i]
            count = 0
            for j in range(n2):
                cur2 = arr2[j]
                if abs(cur1 - cur2) > d:
                    count += 1
            if count == n2:
                result += 1
        return result

算法思路：遍历数组。