[백준, BOJ 2751] 수 정렬하기 2 (java)

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

메모리: 94,388 KB , 시간: 688 ms

사용 알고리즘: 정렬

728x90

---

 

Arrays.sort 사용

메모리: 109,960 KB , 시간: 1,268 ms

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws Exception{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

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

        int[] arr = new int[N];
        for (int i = 0; i < N; i++) {
            arr[i] = Integer.parseInt(br.readLine());
        }

        Arrays.sort(arr);

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < N; i++) {
            result.append(arr[i]).append("\n");
        }
        System.out.println(result);
    }
}

 

boolean 배열 사용

메모리: 94,388 KB , 시간: 688 ms

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {

    public static void main(String[] args) throws Exception{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

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

        // 음수 배열
        boolean[] negative = new boolean[1_000_001];
        // 양수 배열
        boolean[] positive = new boolean[1_000_001];

        int temp;
        for (int i = 0; i < N; i++) {
            temp = Integer.parseInt(br.readLine());

            if(temp < 0) {
                negative[-1 * temp] = true;
            }
            else {
                positive[temp] = true;
            }
        }

        StringBuilder result = new StringBuilder();
        for (int i = 1_000_000; i > 0; i--) {
            if(negative[i]) result.append(-1 * i).append("\n");
        }
        for (int i = 0; i <= 1_000_000; i++) {
            if(positive[i]) result.append(i).append("\n");
        }
        System.out.println(result);
    }
}