Facile 0 résolus 0 % de réussite

Middle Item

Read numbers up to a negative sentinel and return the middle one.

Ce que vous allez apprendre

  • Stop reading input at a sentinel value
  • Find the middle index of a list
  • Handle an empty input

Problème

Afficher la traduction

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.

Contraintes

0 ≤ length of values ≤ 1000

−1000 ≤ each value ≤ 1000

Exemples

Exemple 1
Entrée :
values = [88, 72, 95, 60, 81, -1]

Sortie attendue :
expected = 95
Entrée :
std::vector<long long> values = {88, 72, 95, 60, 81, -1};

Sortie attendue :
long long expected = 95;
Entrée :
long[] values = new long[] {88, 72, 95, 60, 81, -1};

Sortie attendue :
long expected = 95;

Explication

The scores are 88, 72, 95, 60, 81; there are 5, so the middle is position 2, which is 95.

Exemple 2
Entrée :
values = [10, 20, 30, 40, -5, 50]

Sortie attendue :
expected = 30
Entrée :
std::vector<long long> values = {10, 20, 30, 40, -5, 50};

Sortie attendue :
long long expected = 30;
Entrée :
long[] values = new long[] {10, 20, 30, 40, -5, 50};

Sortie attendue :
long expected = 30;

Explication

Reading stops at −5, leaving 4 scores; position 2 holds 30.

Comment l'aborder

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

Indice 1

Copy values into a new list until you meet the first negative number.

Indice 2

With k items the middle index is k / 2 using integer division.

Indice 3

If nothing was copied, there is no middle item.

Complexité attendue

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

Références

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

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.