[LeetCode] 414. Third Maximum Number, Easy
·
CodingTest/LeetCode
1. 문제정수 배열 nums가 주어질 때, 고유한 값 중 3번 째로 큰 요소를 반환하라.2. 해결function thirdMax(nums: number[]): number { let firstMax = -Infinity, secondMax = -Infinity, thirdMax = -Infinity; new Set(nums).forEach(num => { if (num > firstMax) { thirdMax = secondMax; secondMax = firstMax; firstMax = num; } else if (num > secondMax) { thirdMax = secondMax; ..