알고리즘/Class 2

백준 BOJ 2164번

edvedv 2022. 8. 20. 13:33


코드

import java.util.LinkedList;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        LinkedList<Integer> arr = new LinkedList<Integer>();
        for(int i = 1; i <= n; i++){
            arr.add(i);
        }
        while(true){
            if(arr.size() == 1) break;
            arr.remove();
            arr.add(arr.poll());
        }
        System.out.println(arr.get(0));
    }
}