Solution: Third Maximum Number
Explore how to determine the third distinct maximum number in an integer array by using a min heap combined with a set. Understand how to track unique numbers, manage the heap with three elements, and handle different cases efficiently with linear time and constant space complexity.
We'll cover the following...
We'll cover the following...
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:
...