T_era

[JAVA] 백준 2751 : 수 정렬하기 본문

Programing/BaekJoon

[JAVA] 백준 2751 : 수 정렬하기

블스뜸 2025. 3. 29. 15:20

단어정렬 문제를 풀었던 것을 기반으로 풀어봤다

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;


public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        HashSet<String> word = new HashSet<>();
        ArrayList<Integer> temp = new ArrayList<>();

        int count = Integer.parseInt(br.readLine());

        for (int i = 0; i < count; i++){
            String str = br.readLine();
            if(word.add(str)){
                temp.add(Integer.parseInt(str));
            }
        }

        Integer[] numList = temp.toArray(new Integer[0]);

        Arrays.sort(numList, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o1 - o2;
            }
        });

        for (Integer i : numList ){
            bw.write(String.valueOf(i));
            bw.newLine();
        }

        bw.flush();
        bw.close();
        br.close();
    }
}