Second Largest Value

Problème

Return the second largest distinct value in the list. Repeated values count once.

Implement second_largest(numbers).

numbers: A list of non-negative integers.

Return the second largest distinct value, or -1 if it doesn't exist.

0 ≤ length ≤ 100,000; 0 ≤ each value ≤ 10⁹

Exemple 1

Entrée :
numbers = [4, 9, 7, 9]

Sortie attendue :
expected = 7

Entrée :
std::vector<long long> numbers = {4, 9, 7, 9};

Sortie attendue :
long long expected = 7;

Entrée :
long[] numbers = new long[] {4, 9, 7, 9};

Sortie attendue :
long expected = 7;

Distinct values are 9, 7, 4; the second largest is 7.

Exemple 2

Entrée :
numbers = [5, 5]

Sortie attendue :
expected = -1

Entrée :
std::vector<long long> numbers = {5, 5};

Sortie attendue :
long long expected = -1;

Entrée :
long[] numbers = new long[] {5, 5};

Sortie attendue :
long expected = -1;

Only one distinct value exists, so the answer is -1.

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

You need the largest and the next different value, not just the top two positions.

Indice 2

Track two distinct maxima as you scan, updating them when a new value fits above or between them.

Indice 3

If no second distinct value ever appears, return the special fallback value.

Complexité attendue

O(n) time, O(1) extra space

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.