More solutions and unit tests

Author: spannm

src/main/java/io/github/spannm/leetcode/lc0/lc0400/Problem0488.java

@@ -4,23 +4,23 @@
 
 class Problem0488 extends LeetcodeProblem {
 
-    private final int maxcount = 6;
+    private static final int MAX_COUNT = 6;
 
-    public int findMinStep(String _board, String _hand) {
+    int findMinStep(String _board, String _hand) {
         int[] handCount = new int[26];
         for (int i = 0; i < _hand.length(); i++) {
-            ++handCount[_hand.charAt(i) - 'A'];
+            handCount[_hand.charAt(i) - 'A']++;
         }
         int result = dfs(_board + "#", handCount);
-        return result == maxcount ? -1 : result;
+        return result == MAX_COUNT ? -1 : result;
     }
 
-    private int dfs(String _s, int[] _handCount) {
+    static int dfs(String _s, int[] _handCount) {
         _s = removeConsecutive(_s);
         if ("#".equals(_s)) {
             return 0;
         }
-        int result = maxcount;
+        int result = MAX_COUNT;
         int need = 0;
         for (int i = 0, j = 0; j < _s.length(); j++) {
             if (_s.charAt(j) == _s.charAt(i)) {
@@ -37,7 +37,7 @@ private int dfs(String _s, int[] _handCount) {
         return result;
     }
 
-    private String removeConsecutive(String _board) {
+    static String removeConsecutive(String _board) {
         for (int i = 0, j = 0; j < _board.length(); j++) {
             if (_board.charAt(j) == _board.charAt(i)) {
                 continue;

src/test/java/io/github/spannm/leetcode/lc1/lc1200/Problem1248Test.java

@@ -0,0 +1,18 @@
+package io.github.spannm.leetcode.lc1.lc1200;
+
+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 Problem1248Test extends LeetcodeBaseTest {
+    @ParameterizedTest(name = "[{index}] {0}; {1} --> {2}")
+    @CsvSource(delimiter = ';', value = {
+        "1,1,2,1,1; 3; 2",
+        "2,4,6; 1 ; 0",
+        "2,2,2,1,2,2,1,2,2,2; 2; 16"
+    })
+    void test(@ConvertWith(CsvToIntArray.class) int[] _nums, int _k, int _expectedResult) {
+        assertEquals(_expectedResult, new Problem1248().numberOfSubarrays(_nums, _k));
+    }
+}

src/test/java/io/github/spannm/leetcode/lc1/lc1500/Problem1552Test.java

@@ -0,0 +1,17 @@
+package io.github.spannm.leetcode.lc1.lc1500;
+
+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 Problem1552Test extends LeetcodeBaseTest {
+    @ParameterizedTest(name = "[{index}] {0}; {1} --> {2}")
+    @CsvSource(delimiter = ';', value = {
+        "1,2,3,4,7; 3; 3",
+        "5,4,3,2,1,1000000000; 2; 999999999"
+    })
+    void test(@ConvertWith(CsvToIntArray.class) int[] _basketPositions, int _nbBalls, int _expectedResult) {
+        assertEquals(_expectedResult, new Problem1552().maxDistance(_basketPositions, _nbBalls));
+    }
+}