Search⌘ K
AI Features

Solution: Third Maximum Number

Explore how to determine the third distinct maximum element in an integer array by using a min heap and set to track unique numbers. Understand managing duplicates, maintaining the top three largest values efficiently, and handling edge cases with fewer than three distinct elements.

Statement

Given an integer array nums, determine and return the third distinct maximum element in the array. If the array contains fewer than three distinct elements, return the maximum element instead.

Constraints:

  • 1<=1 <= ...