Facile 0 risolte 0% di accettazione

Middle Item

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

Cosa imparerai

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

Problema

Mostra traduzione

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.

Vincoli

0 ≤ length of values ≤ 1000

−1000 ≤ each value ≤ 1000

Esempi

Esempio 1
Input:
values = [88, 72, 95, 60, 81, -1]

Output atteso:
expected = 95
Input:
std::vector<long long> values = {88, 72, 95, 60, 81, -1};

Output atteso:
long long expected = 95;
Input:
long[] values = new long[] {88, 72, 95, 60, 81, -1};

Output atteso:
long expected = 95;

Spiegazione

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

Esempio 2
Input:
values = [10, 20, 30, 40, -5, 50]

Output atteso:
expected = 30
Input:
std::vector<long long> values = {10, 20, 30, 40, -5, 50};

Output atteso:
long long expected = 30;
Input:
long[] values = new long[] {10, 20, 30, 40, -5, 50};

Output atteso:
long expected = 30;

Spiegazione

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

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

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

Suggerimento 2

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

Suggerimento 3

If nothing was copied, there is no middle item.

Complessità attesa

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

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.