Volver a los desafíos
Fácil 0 resueltos 0% de aceptación

Sum the Valid Numbers

Add up the entries that are whole numbers and skip everything else, the way try/except handles bad input.

Lo que aprenderás

  • Skip invalid input instead of crashing
  • Trim spaces before converting text to a number
  • Recognise an optional sign followed by digits

Problema

Ver traducción

Data typed by people is messy. You get a list of strings and must add up the ones that are whole numbers, ignoring the rest instead of crashing.

An entry counts if, after removing spaces at both ends, it is an optional + or - sign followed by one or more digits. Anything else (empty text, decimals such as "2.5", words) is skipped.

Implement sum_valid_numbers(values).

Input

values: The entries to read.

Output

Return the sum of the valid whole numbers (0 if there are none).

Restricciones

0 ≤ number of entries ≤ 1,000

Each entry has at most 20 characters; valid numbers fit in a 64-bit integer

Ejemplos

Ejemplo 1
Entrada:
values = ["10", " 5 ", "abc", "-3"]

Salida esperada:
expected = 12
Entrada:
std::vector<std::string> values = {"10", " 5 ", "abc", "-3"};

Salida esperada:
long long expected = 12;
Entrada:
string[] values = new string[] {"10", " 5 ", "abc", "-3"};

Salida esperada:
long expected = 12;

Explicación

"10", " 5 " (spaces are trimmed) and "-3" are whole numbers; "abc" is skipped. 10 + 5 - 3 = 12.

Ejemplo 2
Entrada:
values = ["2.5", "", "seven"]

Salida esperada:
expected = 0
Entrada:
std::vector<std::string> values = {"2.5", "", "seven"};

Salida esperada:
long long expected = 0;
Entrada:
string[] values = new string[] {"2.5", "", "seven"};

Salida esperada:
long expected = 0;

Explicación

None of the entries is a whole number, so the sum is 0.

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

Strip the spaces first, then decide whether what is left is a valid whole number.

Pista 2

Converting inside try/except (or checking the characters) lets you skip bad entries without stopping.

Pista 3

Remember that a lone sign such as "+" is not a number.

Complejidad esperada

O(total length) time, O(1) extra space

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.