알고리즘
[백준 10818][Swift] 최소, 최대
moving
2022. 4. 1. 15:01
728x90
코드
let input = Int(readLine()!)!
let numArray = (readLine()?.split(separator: " ").map { Int($0)! })!
var min: Int = numArray[0]
var max: Int = numArray[0]
for i in 0..<input {
if min > numArray[i] {
min = numArray[i]
}
if max < numArray[i] {
max = numArray[i]
}
}
print(min, max)
제약조건없이 간단하게
let input = Int(readLine()!)!
let numArray = (readLine()?.split(separator: " ").map { Int($0)! })!
let num = numArray.sorted()
print(num.first!, num.last!)
// or
print(numArray.min()!, numArray.max()!)
https://www.acmicpc.net/problem/10818