백준[Java] 10871번 최소,최대

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

10818번: 최소, 최대

문제풀이 1

import java.util.Arrays;
import java.util.Scanner;
public class _10818_1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int[] arr = new int[N];

        for (int i = 0; i < N; i++) {
            arr[i] = sc.nextInt();
        }
        sc.close();

        Arrays.sort(arr);
        System.out.println(arr[0] + " " + arr[N-1]);
    }
}

---

문제풀이 2

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

public class _10818_2 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int N = Integer.parseInt(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine()," ");

        int index = 0;
        int[] arr = new int[N];
        while(st.hasMoreTokens()) {
            arr[index] = Integer.parseInt(st.nextToken());
            index++;
        }
        br.close();

        Arrays.sort(arr);
        System.out.print(arr[0] + " " + arr[N - 1]);
    }
}

hasMoreTokens(): StringTokenizer 에 토큰이 남아있으면 true 반환, 비어있으면 false 반환

---