-
Notifications
You must be signed in to change notification settings - Fork 40
/
ThirdMaximumNumber.js
53 lines (48 loc) · 1.25 KB
/
ThirdMaximumNumber.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// Source : https://leetcode.com/problems/third-maximum-number
// Author : Dean Shi
// Date : 2020-04-17
/***************************************************************************************
* Given a non-empty array of integers, return the third maximum number in this array.
* If it does not exist, return the maximum number. The time complexity must be in O(n).
*
* Example 1:
* Input: [3, 2, 1]
*
* Output: 1
*
* Explanation: The third maximum is 1.
*
* Example 2:
* Input: [1, 2]
*
* Output: 2
*
* Explanation: The third maximum does not exist, so the maximum (2) is returned
* instead.
*
* Example 3:
* Input: [2, 2, 3, 1]
*
* Output: 1
*
* Explanation: Note that the third maximum here means the third maximum distinct
* number.
* Both numbers with value 2 are both considered as second maximum.
*
*
***************************************************************************************/
/**
* @param {number[]} nums
* @return {number}
*/
var thirdMax = function(nums) {
const list = []
for (let num of new Set(nums)) {
list.push(num)
list.sort((a, b) => b - a)
if (list.length > 3) {
list.pop()
}
}
return list.length === 3 ? list.pop() : list.shift()
};