GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #414 - Third Maximum Number - LeetCode JavaScript Solutions

Back to all solutions

#414 - Third Maximum Number

Easy • View on LeetCode • View on GitHub

Array Sorting

Problem Description

Given an integer array nums, return the third distinct maximum number in this array.

If the third maximum does not exist, return the maximum number.

Solution

/**
 * @param {number[]} nums
 * @return {number}
 */
var thirdMax = function(nums) {
  const sortedSet = [...new Set(nums)].sort((a, b) => a - b);
  const thirdMax = sortedSet[sortedSet.length - 3];

  return thirdMax !== undefined
    ? thirdMax
    : sortedSet[sortedSet.length - 1];
};

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.