From db091bfc3fb8923320aceb12d9a1adadb79e49de Mon Sep 17 00:00:00 2001
From: Park Semin <semin6634@naver.com>
Date: Sat, 29 Mar 2025 12:49:04 +0900
Subject: [PATCH 1/2] [ADD] baekjoon 1158 java solution

---
 solutions/baekjoon/1158/Main.java | 77 +++++++++++++++++++++++++++++++
 1 file changed, 77 insertions(+)
 create mode 100644 solutions/baekjoon/1158/Main.java

diff --git a/solutions/baekjoon/1158/Main.java b/solutions/baekjoon/1158/Main.java
new file mode 100644
index 0000000..2f655f7
--- /dev/null
+++ b/solutions/baekjoon/1158/Main.java
@@ -0,0 +1,77 @@
+// Authored by : semInDev
+// Co-authored by : -
+// Link : https://www.acmicpc.net/problem/1158
+
+import java.util.*;
+import java.io.*;
+
+public class Main {
+
+	public static void main(String[] args)throws IOException{
+		FastReader input = new FastReader();
+		
+		int N = input.nextInt();
+		int K = input.nextInt();
+		
+		StringBuilder sb = new StringBuilder();
+		sb.append("<");
+		
+		Queue<Integer> queue = new ArrayDeque<>();
+		for(int i=1; i<N+1; i++) { // 초기값
+			queue.add(i);
+		}
+		
+		while(queue.size()!=1) {
+			for(int i=0; i<K-1; i++) { // K-1번째까지 poll하지 않고 넘어감
+				int temp = queue.poll();
+				queue.add(temp);
+			}
+			sb.append(queue.poll() + ", "); // K번째는 poll
+		}
+		sb.append(queue.poll()+">");
+		
+		System.out.println(sb);
+	}
+	
+    static class FastReader {
+        BufferedReader br;
+        StringTokenizer st;
+
+        public FastReader() throws IOException{
+        	br = new BufferedReader(new InputStreamReader(System.in)); //백준 제출 시 주석해제를 하면 됩니다.
+        	// br = new BufferedReader(new FileReader("input.txt")); //IDE 실행 시 주석해제를 하면 됩니다.
+        }
+
+        String next() {
+            while(st == null || !st.hasMoreElements()) {
+                try {
+                    st = new StringTokenizer(br.readLine());
+                }
+                catch (IOException e) {
+                    e.printStackTrace();
+                }
+            }
+            return st.nextToken();
+        }
+
+        int nextInt() { return Integer.parseInt(next()); }
+        long nextLong() { return Long.parseLong(next()); }
+        String nextLine() {
+            String str = "";
+            try {
+                str = br.readLine();
+            }
+            catch (IOException e) {
+                e.printStackTrace();
+            }
+            return str;
+        }
+    }
+}
+
+/* Solution Description
+	
+	- java 컬렉션 프레임워크의 Queue(ArrayDeque로 구현)를 사용한다.
+	원형으로 앉은 사람들을 순서대로 카운트하는 것을 큐를 통해 구현할 수 있다.
+	
+ */
\ No newline at end of file

From 6fc8d398fdc1fd7c3a6dcf30f10ab30a1123aec8 Mon Sep 17 00:00:00 2001
From: sem_in_github <semin6634@naver.com>
Date: Sat, 19 Apr 2025 16:37:23 +0900
Subject: [PATCH 2/2] Update baekjoon 1158 java solution

---
 solutions/baekjoon/1158/Main.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/solutions/baekjoon/1158/Main.java b/solutions/baekjoon/1158/Main.java
index 2f655f7..9075cbf 100644
--- a/solutions/baekjoon/1158/Main.java
+++ b/solutions/baekjoon/1158/Main.java
@@ -1,6 +1,6 @@
 // Authored by : semInDev
 // Co-authored by : -
-// Link : https://www.acmicpc.net/problem/1158
+// Link : http://boj.kr/6a3de2f34e644e82a44ff0c1f7e16439
 
 import java.util.*;
 import java.io.*;
@@ -74,4 +74,4 @@ String nextLine() {
 	- java 컬렉션 프레임워크의 Queue(ArrayDeque로 구현)를 사용한다.
 	원형으로 앉은 사람들을 순서대로 카운트하는 것을 큐를 통해 구현할 수 있다.
 	
- */
\ No newline at end of file
+ */