Skip to content

Latest commit

 

History

History
21 lines (7 loc) · 241 Bytes

File metadata and controls

21 lines (7 loc) · 241 Bytes

정수 배열(int array)이 주어지면 두번째로 큰 값을 프린트하시오.

Given an integer array, find the second largest element.

예제)

Input: [10, 5, 4, 3, -1]

Output: 5

Input: [3, 3, 3]

Output: Does not exist.