Search⌘ K
AI Features

Solution: Third Maximum Number

Explore how to determine the third distinct maximum number in an integer array by applying a min heap and set. Learn to handle duplicates, maintain the top three distinct values, and implement a linear time solution with constant space complexity.

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 <= nums.length <=103<= 10^3 ...