요세푸스 문제

📔 문제 설명

https://www.acmicpc.net/problem/1158

📝 문제 풀이

ㄴㅇㅁㄴ
ㄴㅇ
ㄴㅇ
ㄴㅇ

💡 내 코드

public class Main {
	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		 
		int N = Integer.parseInt(st.nextToken());
	    int result= 0;
		int K = Integer.parseInt(st.nextToken());
		Queue<Integer> q = new LinkedList<>();
		StringBuilder sb = new StringBuilder();
	    sb.append("<");
		
		for (int i = 1; i <N+1; i++) {
			q.add(i);
			
		}
		while(q.size()!=1) {
			for (int i = 1; i < K; i++) {
				q.add(q.poll());
			}
			result =q.poll();
			sb.append(result).append(", ");
			
			}
		
		sb.append(q.poll()).append(">");
		System.out.println(sb.toString());	
	}
}

✍느낀점