티스토리 뷰
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
int size = Integer.parseInt(in.readLine());
long[] array = new long[size];
for(int i=0; i<size; ++i) {
array[i] = Long.parseLong(in.readLine());
}
Arrays.sort(array);
long resultNumber = Long.MIN_VALUE;
int resultCount = 0;
long currentNumber = array[0];
int currentCount = 1;
for(int i=1; i<size; ++i) {
long value = array[i];
if(value == currentNumber) {
++currentCount;
} else {
if(resultCount < currentCount) {
resultCount = currentCount;
resultNumber = array[i - 1];
}
currentCount = 1;
currentNumber = value;
}
}
if(resultCount < currentCount) {
System.out.println(array[size - 1]);
} else {
System.out.println(resultNumber);
}
}
}
정렬한 후 순회하면서 조건에 맞는 값을 찾아준다.
let size = Int(readLine()!)!
var array = Array(repeating: 0, count: size)
for i in 0..<size {
array[i] = Int(readLine()!)!
}
array.sort()
var resultNumber = Int.min
var resultCount = 0
var currentNumber = array.first!
var currentCount = 1
for i in 1..<size {
let value = array[i]
if value == currentNumber {
currentCount += 1
} else {
if resultCount < currentCount {
resultCount = currentCount
resultNumber = array[i - 1]
}
currentCount = 1
currentNumber = value
}
}
if resultCount < currentCount {
print(array[size - 1])
} else {
print(resultNumber)
}
'Algorithm > Baekjoon Online Judge' 카테고리의 다른 글
1260번 'DFS와 BFS' (0) | 2018.08.09 |
---|---|
11004번 'K번째 수' (0) | 2018.08.07 |
10989번 '수 정렬하기 3' (0) | 2018.08.05 |
10825번 '국영수' (0) | 2018.08.05 |
10814번 '나이순 정렬' (0) | 2018.08.05 |
댓글