More solutions and unit tests

Author: spannm

src/main/java/io/github/spannm/leetcode/lc0/lc0300/Problem0350.java

@@ -2,25 +2,17 @@
 
 import io.github.spannm.leetcode.LeetcodeProblem;
 
-import java.util.*;
+import java.util.Arrays;
 
+/**
+ * 350. Intersection of Two Arrays II.
+ */
 class Problem0350 extends LeetcodeProblem {
 
     int[] intersect(int[] _nums1, int[] _nums2) {
-        Map<Integer, Integer> map = new HashMap<>();
-        for (int i : _nums1) {
-            map.compute(i, (k, v) -> v == null ? 1 : v + 1);
-        }
-
-        List<Integer> list = new ArrayList<>();
-        for (int i : _nums2) {
-            int val = Objects.requireNonNullElse(map.get(i), 0);
-            if (val > 0) {
-                list.add(i);
-                map.put(i, val - 1);
-            }
-        }
-        return list.stream().mapToInt(i -> i).toArray();
+        int[] counts = new int[1001];
+        Arrays.stream(_nums1).forEach(n -> counts[n]++);
+        return Arrays.stream(_nums2).filter(n -> counts[n]-- > 0).toArray();
     }
 
 }

src/main/java/io/github/spannm/leetcode/lc1/lc1300/Problem1350.java

@@ -0,0 +1,17 @@
+package io.github.spannm.leetcode.lc1.lc1300;
+
+import io.github.spannm.leetcode.LeetcodeSqlProblem;
+
+/**
+ * 1350. Students With Invalid Departments.
+ */
+public class Problem1350 extends LeetcodeSqlProblem {
+
+    Problem1350() {
+        super("""
+SELECT id, name
+FROM Students
+WHERE department_id NOT IN (SELECT id FROM Departments)""");
+    }
+
+}

src/test/java/io/github/spannm/leetcode/lc0/lc0300/Problem0350Test.java

@@ -0,0 +1,23 @@
+package io.github.spannm.leetcode.lc0.lc0300;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+import io.github.spannm.leetcode.LeetcodeBaseTest;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.converter.ConvertWith;
+import org.junit.jupiter.params.provider.CsvSource;
+
+class Problem0350Test extends LeetcodeBaseTest {
+    @ParameterizedTest(name = "[{index}] {0}; {1} --> {2}")
+    @CsvSource(delimiter = ';', value = {
+        "1,2,2,1; 2,2; 2,2",
+        "4,9,5; 9,4,9,8,4; 4,9"
+    })
+    void test(
+        @ConvertWith(CsvToIntArray.class) int[] _nums1,
+        @ConvertWith(CsvToIntArray.class) int[] _nums2,
+        @ConvertWith(CsvToIntArray.class) int[] _expectedResult) {
+        int[] actual = new Problem0350().intersect(_nums1, _nums2);
+        assertThat(actual).containsExactlyInAnyOrder(_expectedResult);
+    }
+}

src/test/java/io/github/spannm/leetcode/lc2/lc2100/Problem2192Test.java

@@ -1,11 +1,12 @@
 package io.github.spannm.leetcode.lc2.lc2100;
 
 import io.github.spannm.leetcode.LeetcodeBaseTest;
-import java.util.List;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.converter.ConvertWith;
 import org.junit.jupiter.params.provider.CsvSource;
 
+import java.util.List;
+
 class Problem2192Test extends LeetcodeBaseTest {
     @ParameterizedTest(name = "[{index}] {0}; {1} --> {2}")
     @CsvSource(delimiter = ';', value = {

src/test/java/io/github/spannm/leetcode/tool/UnitTestCreator.java

@@ -182,8 +182,8 @@ boolean createUnitTest(Class<?> _clazz) throws IOException {
     }
 
     Method findTestMethod(Class<?> _clazz) {
-        List<Method> list = Arrays.stream(_clazz.getDeclaredMethods().length > 0 ? _clazz.getDeclaredMethods() :
-            Arrays.stream(_clazz.getDeclaredClasses())
+        List<Method> list = Arrays.stream(_clazz.getDeclaredMethods().length > 0 ? _clazz.getDeclaredMethods()
+            : Arrays.stream(_clazz.getDeclaredClasses())
                 .filter(c -> Modifier.isStatic(c.getModifiers()))
                 .map(Class::getDeclaredMethods)
                 .filter(arr -> arr.length > 0)