refactor: generalize day 4 part 1 solution

Author: Flashky

src/main/java/com/adventofcode/flashk/day04/CeresSearch.java

@@ -40,47 +40,24 @@ public CeresSearch(char[][] input){
     }
 
     public long solveA() {
-        long totalCount = countHorizontal();
-        totalCount += countVertical();
-        totalCount += countDiagonal();
-        return totalCount;
+        return xPositions.stream().map(this::find).reduce(0, Integer::sum);
     }
 
     public long solveB() {
         return aPositions.stream().filter(this::hasMasDiagonal1).filter(this::hasMasDiagonal2).count();
     }
 
-    private int countHorizontal() {
-        int totalCount = 0;
-        for(int row = 0; row < rows; row++) {
-            String line = new String(input[row]);
-            totalCount += StringUtils.countMatches(line, XMAS) + StringUtils.countMatches(line, SAMX);
-        }
-        return totalCount;
-    }
-
-    private int countVertical() {
-
-        char[][] transposedInput = Array2DUtil.transpose(input);
-        int totalCount = 0;
-        for(int row = 0; row < rows; row++) {
-            String line = new String(transposedInput[row]);
-            totalCount += StringUtils.countMatches(line, XMAS) + StringUtils.countMatches(line, SAMX);
-        }
-        return totalCount;
-    }
-
-    private long countDiagonal() {
-        return xPositions.stream().map(this::find).reduce(0, Integer::sum);
-    }
-
     private int find(Vector2 xPos) {
         char[] word = MAS.toCharArray();
 
         int totalCount = find(word, 0, xPos, new Vector2(-1,-1));
         totalCount += find(word, 0, xPos, new Vector2(-1,1));
         totalCount += find(word, 0, xPos, new Vector2(1,-1));
         totalCount += find(word, 0, xPos, new Vector2(1,1));
+        totalCount += find(word, 0, xPos, new Vector2(-1,0));
+        totalCount += find(word, 0, xPos, new Vector2(1,0));
+        totalCount += find(word, 0, xPos, new Vector2(0,-1));
+        totalCount += find(word, 0, xPos, new Vector2(0,1));
 
         return totalCount;
     }
@@ -153,4 +130,4 @@ private boolean isOutOfRange(int row, int col) {
         return row < 0 || row >= rows || col < 0 || col >= cols;
     }
 
-}
+}