Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 414 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 414 # by problem number
lcpy gen -s third_maximum_number # by problem name
nums.
Return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number.
Input: nums = [3,2,1]
Output: 1
Input: nums = [1,2]
Output: 2
Input: nums = [2,2,3,1]
Output: 1
O(n) solution?
class Solution:
# Time: O(n)
# Space: O(1)
def third_max(self, nums: list[int]) -> int:
top: list[int] = []
for num in nums:
if num in top:
continue
top.append(num)
top.sort(reverse=True)
if len(top) > 3:
top.pop()
return top[2] if len(top) > 2 else top[0]
| Time | Space |
|---|---|
| O(n) | O(1) |