Problème
After a fundraiser, the club treasurer has the amount each member collected and wants three quick numbers: the smallest amount, the largest amount and the average.
Implement simple_statistics(numbers).
Input
numbers: The amounts collected.
Output
Return [minimum, maximum, average] as numbers. The average is the sum divided by the count, not rounded (checked to within 0.000001). For an empty list return an empty list.
Contraintes
0 ≤ length of numbers ≤ 1000
−1,000,000 ≤ each number ≤ 1,000,000
Exemples
Entrée :
numbers = [40, 15, 70, 35]
Sortie attendue :
expected = [15.0, 70.0, 40.0]
Entrée :
std::vector<long long> numbers = {40, 15, 70, 35};
Sortie attendue :
std::vector<double> expected = {15.0, 70.0, 40.0};
Entrée :
long[] numbers = new long[] {40, 15, 70, 35};
Sortie attendue :
double[] expected = new double[] {15.0, 70.0, 40.0};
Explication
The smallest is 15, the largest is 70, and the average is 160 / 4 = 40, so [15.0, 70.0, 40.0].
Entrée :
numbers = [5, 6]
Sortie attendue :
expected = [5.0, 6.0, 5.5]
Entrée :
std::vector<long long> numbers = {5, 6};
Sortie attendue :
std::vector<double> expected = {5.0, 6.0, 5.5};
Entrée :
long[] numbers = new long[] {5, 6};
Sortie attendue :
double[] expected = new double[] {5.0, 6.0, 5.5};
Explication
The average of 5 and 6 is 5.5, so [5.0, 6.0, 5.5].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Start the minimum and maximum at the first value, not at 0.
Indice 2
Keep a running sum as you go.
Indice 3
Convert to a decimal type before dividing the sum by the count.
Complexité attendue
O(n) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.