From b7624dd1bada57b49d3f784cb76245a17725fff6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B0=95=EC=8B=A0=EC=A7=80?=
 <101992179+ksinji@users.noreply.github.com>
Date: Fri, 17 Oct 2025 20:04:58 +0900
Subject: [PATCH] =?UTF-8?q?[20251017]=20PGM=20/=20LV2=20/=20=EB=91=90=20?=
 =?UTF-8?q?=ED=81=90=20=ED=95=A9=20=EA=B0=99=EA=B2=8C=20=EB=A7=8C=EB=93=A4?=
 =?UTF-8?q?=EA=B8=B0=20/=20=EA=B0=95=EC=8B=A0=EC=A7=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \353\247\214\353\223\244\352\270\260.md" | 46 +++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 "ksinji/202510/17 PGM \353\221\220 \355\201\220 \355\225\251 \352\260\231\352\262\214 \353\247\214\353\223\244\352\270\260.md"

diff --git "a/ksinji/202510/17 PGM \353\221\220 \355\201\220 \355\225\251 \352\260\231\352\262\214 \353\247\214\353\223\244\352\270\260.md" "b/ksinji/202510/17 PGM \353\221\220 \355\201\220 \355\225\251 \352\260\231\352\262\214 \353\247\214\353\223\244\352\270\260.md"
new file mode 100644
index 00000000..a9fb2ca3
--- /dev/null
+++ "b/ksinji/202510/17 PGM \353\221\220 \355\201\220 \355\225\251 \352\260\231\352\262\214 \353\247\214\353\223\244\352\270\260.md"	
@@ -0,0 +1,46 @@
+```java
+import java.util.*;
+
+class Solution {
+    public int solution(int[] queue1, int[] queue2) {
+        int n = queue1.length;
+        int totalSize = n*2;
+
+        long queueValue = 0, totalValue = 0;
+        int[] nums = new int[totalSize];
+
+        for (int i = 0; i < n; i++) {
+            nums[i] = queue1[i];
+            queueValue += queue1[i];
+            totalValue  += queue1[i];
+        }
+        for (int i = 0; i < n; i++) {
+            nums[n + i] = queue2[i];
+            totalValue += queue2[i];
+        }
+
+        // 전체 합이 홀수면 불가능
+        if (totalValue % 2 == 1) return -1;
+        long half = totalValue / 2;
+
+        if (queueValue == half) return 0;
+
+        int i = 0;      // q1 시작 위치
+        int j = n;      // q2 시작 위치
+        int moves = 0;
+
+        // 각 포인터는 최대 L까지 갈 수 있음
+        while (i < totalSize && j < totalSize) {
+            if (queueValue == half) return moves;
+
+            if (queueValue > half) {
+                queueValue -= nums[i++];
+            } else {
+                queueValue += nums[j++];
+            }
+            moves++;
+        }
+        return -1;
+    }
+}
+```