Problema
The factory method pattern hides how objects are created: you ask the factory for a shape by name and get back an object that knows how to compute its own area.
Each description is a shape name followed by its numbers, separated by spaces:
circle r: area π·r²square s: area s²rectangle w h: area w·htriangle b h: area b·h / 2
Implement shape_factory_areas(shapes).
Input
shapes: The descriptions. Numbers may have decimals.
Output
Return the area of each shape, in order. Answers within 1e-6 are accepted.
Vincoli
1 ≤ number of shapes ≤ 1,000
0 < every number ≤ 1,000
Esempi
Input:
shapes = ["square 3", "rectangle 2 5", "triangle 4 3"]
Output atteso:
expected = [9.0, 10.0, 6.0]
Input:
std::vector<std::string> shapes = {"square 3", "rectangle 2 5", "triangle 4 3"};
Output atteso:
std::vector<double> expected = {9.0, 10.0, 6.0};
Input:
string[] shapes = new string[] {"square 3", "rectangle 2 5", "triangle 4 3"};
Output atteso:
double[] expected = new double[] {9.0, 10.0, 6.0};
Spiegazione
3² = 9, 2·5 = 10 and 4·3/2 = 6.
Input:
shapes = ["circle 1"]
Output atteso:
expected = [3.141592653589793]
Input:
std::vector<std::string> shapes = {"circle 1"};
Output atteso:
std::vector<double> expected = {3.141592653589793};
Input:
string[] shapes = new string[] {"circle 1"};
Output atteso:
double[] expected = new double[] {3.141592653589793};
Spiegazione
π·1² = π ≈ 3.141593.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Read the first word to know which shape to build.
Suggerimento 2
Map each shape name to its area formula.
Suggerimento 3
Use π from your language's math library and keep full precision.
Complessità attesa
O(number of shapes) time, O(number of shapes) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.