Problème
Checks and invoices often show an amount in words. Write the number n in American English using these exact rules:
Implement number_to_words(n).
- All letters are lowercase and words are separated by a single space. There is no "and" and there are no commas.
- 0 to 19:
zero,one, …nineteen. Tens:twenty,thirty,forty,fifty,sixty,seventy,eighty,ninety. - A tens word and a units word are joined with a hyphen: 42 is
forty-two. - Hundreds are written as
<digit> hundred: 305 isthree hundred five. - Groups of three digits get the scale word
thousand,millionorbillion, and a group that is 0 is left out entirely: 1,000,005 isone million five. zerois used only when n is 0.
Input
n: A non-negative integer.
Output
Return the words as one string.
Contraintes
0 ≤ n ≤ 999,999,999,999
Exemples
Entrée :
n = 123
Sortie attendue :
expected = "one hundred twenty-three"
Entrée :
long long n = 123;
Sortie attendue :
std::string expected = "one hundred twenty-three";
Entrée :
long n = 123;
Sortie attendue :
string expected = "one hundred twenty-three";
Explication
One hundred, then twenty and three joined by a hyphen: "one hundred twenty-three".
Entrée :
n = 12045
Sortie attendue :
expected = "twelve thousand forty-five"
Entrée :
long long n = 12045;
Sortie attendue :
std::string expected = "twelve thousand forty-five";
Entrée :
long n = 12045;
Sortie attendue :
string expected = "twelve thousand forty-five";
Explication
The thousands group is 12 and the rest is 45: "twelve thousand forty-five".
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Write a helper that spells numbers from 1 to 999, then reuse it for each group.
Indice 2
Groups go from billions down to units; skip a group that is zero.
Indice 3
Keep separate word lists for 0 to 19 and for the tens.
Complexité attendue
O(1) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.