Add: algorithm of programmers

Author: ImSejin

src/main/java/io/github/imsejin/study/programmers/lv1/L160586.java

@@ -0,0 +1,50 @@
+package io.github.imsejin.study.programmers.lv1;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * <a href="https://school.programmers.co.kr/learn/courses/30/lessons/160586">대충 만든 자판</a>
+ */
+public class L160586 {
+
+    static int[] solve(String[] keymap, String[] targets) {
+        int maxLength = Arrays.stream(keymap).mapToInt(String::length).max().getAsInt();
+        for (int i = 0; i < keymap.length; i++) {
+            keymap[i] = String.format("%-" + maxLength + "s", keymap[i]);
+        }
+
+        Map<Character, Integer> alphabetMap = new HashMap<>();
+        for (int i = 0; i < maxLength; i++) {
+            for (int j = 0; j < keymap.length; j++) {
+                char c = keymap[j].charAt(i);
+                alphabetMap.putIfAbsent(c, i + 1);
+            }
+        }
+
+        int[] counts = new int[targets.length];
+        for (int i = 0; i < targets.length; i++) {
+            String target = targets[i];
+            int length = target.length();
+
+            int count = 0;
+            for (int j = 0; j < length; j++) {
+                char c = target.charAt(j);
+                Integer number = alphabetMap.get(c);
+
+                if (number != null) {
+                    count += number;
+                } else {
+                    count = -1;
+                    break;
+                }
+            }
+
+            counts[i] = count;
+        }
+
+        return counts;
+    }
+
+}

src/main/java/io/github/imsejin/study/programmers/lv1/L64061.java

@@ -18,23 +18,23 @@ static int solve(int[][] board, int[] moves) {
             for (int i = 0; i < row.length; i++) {
                 int cell = board[i][move - 1];
 
-                if (cell > 0) {
-                    Integer prev = null;
-                    if (!stack.isEmpty()) {
-                        prev = stack.peekLast();
-                    }
-
-                    stack.offerLast(cell);
-                    board[i][move - 1] = 0;
-
-                    if (Objects.equals(prev, cell)) {
-                        stack.pollLast();
-                        stack.pollLast();
-                        count++;
-                    }
-
-                    break;
+                if (cell == 0) continue;
+
+                Integer prev = null;
+                if (!stack.isEmpty()) {
+                    prev = stack.peekLast();
                 }
+
+                stack.offerLast(cell);
+                board[i][move - 1] = 0;
+
+                if (Objects.equals(prev, cell)) {
+                    stack.pollLast();
+                    stack.pollLast();
+                    count++;
+                }
+
+                break;
             }
         }
 

src/test/groovy/io/github/imsejin/study/programmers/lv1/L160586Spec.groovy

@@ -0,0 +1,21 @@
+package io.github.imsejin.study.programmers.lv1
+
+import spock.lang.Specification
+
+class L160586Spec extends Specification {
+
+    def "test"() {
+        when:
+        def actual = L160586.solve(keymap as String[], targets as String[])
+
+        then:
+        actual == expected as int[]
+
+        where:
+        keymap             | targets          || expected
+        ["ABACD", "BCEFD"] | ["ABCD", "AABB"] || [9, 4]
+        ["AA"]             | ["B"]            || [-1]
+        ["AGZ", "BSSS"]    | ["ASA", "BGZ"]   || [4, 6]
+    }
+
+}