백준 1158 - 요세푸스 문제(자바 구현)

public class Q_1158 {
    public static void main(String[] args) {
        Queue<Integer> queue = new LinkedList<>();
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        try {
            String readLine = bufferedReader.readLine();
            String[] split = readLine.split(" ");
            String N = split[0];
            String K = split[1];
            //수 넣기
            for(int i=1; i<=Integer.parseInt(N); i++) {
                queue.add(i);
            }
            //수 빼기
            System.out.print("<");
            for (int i=0; i<Integer.parseInt(N)-1; i++) {
                for (int j=0; j<Integer.parseInt(K)-1; j++) {
                    queue.add(queue.peek());
                    queue.remove();
                }
                System.out.printf("%d, ", queue.peek());
                queue.remove();
            }
            System.out.printf("%d>", queue.peek());
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}

 

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