From d9399c17bbbbc06bc1bab5e5e88facd896b05e62 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Tue, 13 Dec 2022 16:34:15 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2013.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=204:34:15?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../크레인 인형뽑기 게임/solution.java        | 28 +++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 programmers/크레인 인형뽑기 게임/solution.java

diff --git a/programmers/크레인 인형뽑기 게임/solution.java b/programmers/크레인 인형뽑기 게임/solution.java
new file mode 100644
index 0000000..647e588
--- /dev/null
+++ b/programmers/크레인 인형뽑기 게임/solution.java	
@@ -0,0 +1,28 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/64061
+
+import java.util.Arrays;
+class Solution {
+    public int solution(int[][] board, int[] moves) {
+        int answer = 0;
+        int bRow = board.length;
+        int sIndex = 0;
+        int[] stack = new int[moves.length];
+        for(int i : moves){
+            for(int j = 0; j < bRow; j++){
+                if(board[j][i-1]!=0){
+                    if(sIndex > 0 && stack[sIndex-1] == board[j][i-1]){
+                        answer += 2;
+                        stack[sIndex--] = 0;
+                    } else {
+                        stack[sIndex++]=board[j][i-1];                  
+                    }
+                    board[j][i-1] = 0;
+                    break;
+                }
+            }
+        }
+        System.out.println(Arrays.toString(stack));
+        System.out.println(answer);
+        return answer;
+    }
+}
\ No newline at end of file