Practice Third Maximum Number
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Third Maximum Number on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [3,2,1]
Output
1
# Example 2
Input
nums = [1,2]
Output
2
# Example 3
Input
nums = [2,2,3,1]
Output
1
Constraints
1 <= nums.length <= 10^4
-2^31 <= nums[i] <= 2^31 - 1
Related LeetCode Problems
Practice more problems similar to Third Maximum Number.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.