Problème
Afficher la traductionReturn the second largest distinct value in the list. Repeated values count once.
Implement second_largest(numbers).
Input
numbers: A list of non-negative integers.
Output
Return the second largest distinct value, or -1 if it doesn't exist.
Contraintes
0 ≤ length ≤ 100,000; 0 ≤ each value ≤ 10⁹
Exemples
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;
Explication
Distinct values are 9, 7, 4; the second largest is 7.
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;
Explication
Only one distinct value exists, so the answer is -1.
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.