Problem
A teacher types quiz scores into a program and ends the list with any negative number, which is a stop signal and not a score. The program should report the middle score in the order the scores were typed (they are not sorted). With k scores the middle one is at position k / 2 counting from 0 and rounding down, so for an even count it is the second of the two middle scores.
Implement middle_item(values).
Input
values: The numbers as typed. Reading stops at the first negative number; it and everything after it are ignored. If there is no negative number, every value is a score.
Output
Return the middle score. If there are no scores before the stop signal, return -1.
Einschränkungen
0 ≤ length of values ≤ 1000
−1000 ≤ each value ≤ 1000
Beispiele
Eingabe:
values = [88, 72, 95, 60, 81, -1]
Erwartete Ausgabe:
expected = 95
Eingabe:
std::vector<long long> values = {88, 72, 95, 60, 81, -1};
Erwartete Ausgabe:
long long expected = 95;
Eingabe:
long[] values = new long[] {88, 72, 95, 60, 81, -1};
Erwartete Ausgabe:
long expected = 95;
Erläuterung
The scores are 88, 72, 95, 60, 81; there are 5, so the middle is position 2, which is 95.
Eingabe:
values = [10, 20, 30, 40, -5, 50]
Erwartete Ausgabe:
expected = 30
Eingabe:
std::vector<long long> values = {10, 20, 30, 40, -5, 50};
Erwartete Ausgabe:
long long expected = 30;
Eingabe:
long[] values = new long[] {10, 20, 30, 40, -5, 50};
Erwartete Ausgabe:
long expected = 30;
Erläuterung
Reading stops at −5, leaving 4 scores; position 2 holds 30.
So gehst du vor
Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.
Hinweis 1
Copy values into a new list until you meet the first negative number.
Hinweis 2
With k items the middle index is k / 2 using integer division.
Hinweis 3
If nothing was copied, there is no middle item.
Erwartete Komplexität
O(n) time, O(n) extra space
Referenzen
Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.