-
Notifications
You must be signed in to change notification settings - Fork 1
/
LeetCode_414_Easy_1.js
26 lines (22 loc) · 990 Bytes
/
LeetCode_414_Easy_1.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
/**
* @param {number[]} nums
* @return {number}
*/
// Problem: 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).
// Input: Non-Empty arrays of integers, can have 1 or more elements and can have duplicates.
// Output: 3rd maximum number if exists.
// If does not exists then the best available should be returned.
// If the duplicate exists for a number, that should not count as individual best
var thirdMax = function(nums) {
// Using a sliding window approach. with each iteration the lowest element from the
// window is deleted, so that we have a set of the top 3.
const maxSet = new Set()
for (const num of nums) {
maxSet.add(num)
if (maxSet.size > 3) {
const min = Math.min(...maxSet)
maxSet.delete(min)
}
}
return maxSet.size === 3 ? Math.min(...maxSet) : Math.max(...maxSet)
};