Algorithm/BaekJoon[Java]
백준 10818
씨니
2022. 3. 17. 11:53
728x90
▶풀이방법1
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int nums[] = new int[num];
for(int i = 0; i < num; i++) {
nums[i] = sc.nextInt();
}
Arrays.sort(nums);
System.out.print(nums[0] + " " + nums[num-1]);
}
}
▶풀이방법2
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int Max = -1000000;
int Min = 1000000;
for(int i = 0; i < num; i++) {
int number = sc.nextInt();
Max = Math.max(Max, number);
Min = Math.min(Min, number);
}
System.out.println(Min + " " + Max);
}
}
728x90