solves find teh values between two arrays

Author: anishLearnsToCode

README.md

@@ -352,7 +352,7 @@
 | 1370 | [Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string)                                                           |                                                           [![Java](assets/java.png)](src/IncreasingDecreasingString.java)                                                            |                                                                                                                                   |
 | 1374 | [Generate A String With Characters That Have Odd Count](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts)        |                                                 [![Java](assets/java.png)](src/GenerateAStringWithCharactersThatHaveOddCounts.java)                                                  |                                                                                                                                   |
 | 1380 | [Lucky Numbers In A Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix)                                                                 |                                                              [![Java](assets/java.png)](src/LuckyNumbersInAMatrix.java)                                                              |                                                                                                                                   |
-| 1385 | [Find The Distance Value Between 2 Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays)                                 |                                                                                                                                                                                      |                                                                                                                                   |
+| 1385 | [Find The Distance Value Between 2 Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays)                                 |                                                      [![Java](assets/java.png)](src/FindTheDistanceValuesBetweenTwoArrays.java)                                                      |                                                                                                                                   |
 | 1389 | [Create Target Array in Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order)                                           |                                                                                                                                                                                      |                                                                                                                                   |
 | 1394 | [Find Lucky Integer In An Array](https://leetcode.com/problems/find-lucky-integer-in-an-array)                                                       |                                                                                                                                                                                      |                                                                                                                                   |
 | 1399 | [Count Largest Group](https://leetcode.com/problems/count-largest-group)                                                                             |                                                                                                                                                                                      |                                                                                                                                   |

src/FindTheDistanceValuesBetweenTwoArrays.java

@@ -0,0 +1,32 @@
+import java.util.TreeSet;
+
+public class FindTheDistanceValuesBetweenTwoArrays {
+    public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
+        TreeSet<Integer> set = new TreeSet<>();
+        for (int number : arr2) {
+            set.add(number);
+        }
+        int distanceValue = 0;
+        for (int number : arr1) {
+            if (smallerOrEqual(set, number) < number - d && largerOrEqual(set, number) > number + d) {
+                distanceValue++;
+            }
+        }
+        return distanceValue;
+    }
+
+    private int smallerOrEqual(TreeSet<Integer> set, int number) {
+        if (set.contains(number)) return number;
+        return valIfNull(set.lower(number), Integer.MIN_VALUE);
+    }
+
+    private int largerOrEqual(TreeSet<Integer> set, int number) {
+        if (set.contains(number)) return number;
+        return valIfNull(set.higher(number), Integer.MAX_VALUE);
+    }
+
+    private int valIfNull(Integer value, int defaultValue) {
+        if (value == null) return defaultValue;
+        return value;
+    }
+}