LeetCode: Third Maximum Number Solution

Approach

Filter unique numbers

Sort that array

If there is the 3rd element, get it, else get the 1st one

Implementation

1/**
2 * @param {number[]} nums
3 * @return {number}
4 */
5var thirdMax = function (nums) {
6  const uniqueNums = [...new Set(nums)]
7  uniqueNums.sort((a, b) => b - a)
8
9  return uniqueNums[2] !== undefined ? uniqueNums[2] : uniqueNums[0]
10}