add 1385

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1385|[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1385.java) | |Easy|Array|
 |1382|[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1382.java) | |Medium|Binary Search Tree|
 |1381|[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1381.java) | |Medium|Stack, Design|
 |1380|[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1380.java) | |Easy|Array|

src/main/java/com/fishercoder/solutions/_1385.java

@@ -0,0 +1,60 @@
+package com.fishercoder.solutions;
+
+/**
+ * 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.
+ *
+ * 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
+ * */
+public class _1385 {
+    public static class Solution1 {
+        public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
+            int count = 0;
+            for (int i = 0; i < arr1.length; i++) {
+                int j = 0;
+                for (; j < arr2.length; j++) {
+                    if (Math.abs(arr1[i] - arr2[j]) <= d) {
+                        break;
+                    }
+                }
+                if (j == arr2.length) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}

src/test/java/com/fishercoder/_1385Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1385;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1385Test {
+    private static _1385.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1385.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.findTheDistanceValue(new int[]{4, 5, 8}, new int[]{10, 9, 1, 8}, 2));
+    }
+
+}