Add: algorithm of programmers

Author: ImSejin

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

@@ -0,0 +1,44 @@
+package io.github.imsejin.study.programmers.lv1;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+import java.util.Objects;
+
+/**
+ * <a href="https://school.programmers.co.kr/learn/courses/30/lessons/64061">크레인 인형뽑기 게임</a>
+ */
+public class L64061 {
+
+    static int solve(int[][] board, int[] moves) {
+        int count = 0;
+        Deque<Integer> stack = new ArrayDeque<>();
+
+        for (int move : moves) {
+            int[] row = board[move - 1];
+            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;
+                }
+            }
+        }
+
+        return count * 2;
+    }
+
+}

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

@@ -0,0 +1,19 @@
+package io.github.imsejin.study.programmers.lv1
+
+import spock.lang.Specification
+
+class L64061Spec extends Specification {
+
+    def "test"() {
+        when:
+        def actual = L64061.solve(board as int[][], moves as int[])
+
+        then:
+        actual == expected
+
+        where:
+        board                                                                                 | moves                    || expected
+        [[0, 0, 0, 0, 0], [0, 0, 1, 0, 3], [0, 2, 5, 0, 1], [4, 2, 4, 4, 2], [3, 5, 1, 3, 1]] | [1, 5, 3, 5, 1, 2, 1, 4] || 4
+    }
+
+}