Search⌘ K
AI Features

Solution: Third Maximum Number

Explore how to determine the third distinct maximum element in an integer array using a min heap and set. Understand how to handle duplicates, maintain top three values efficiently, and return the correct result based on the number of 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 <= ...