Условие
A sign maker spells out house numbers in words and pays by the letter. Write every number from 1 to n in American English, without the word "and": 342 is "three hundred forty-two" and 2005 is "two thousand five". Spaces and hyphens are free; only letters count.
Implement number_letter_counts(n).
Spellings: one to nineteen, twenty, thirty, forty, fifty, sixty, seventy, eighty, ninety, hundred, thousand. Numbers from 1,000 up are written as the thousands part (itself in words, up to ninety-nine) followed by "thousand" and then the rest, if any.
Input
n: The last number to write.
Output
Return the total number of letters used for 1, 2, ..., n. For n = 0 nothing is written and the answer is 0.
Ограничения
0 ≤ n ≤ 99,999
Примеры
Ввод:
n = 3
Ожидаемый вывод:
expected = 11
Ввод:
long long n = 3;
Ожидаемый вывод:
long long expected = 11;
Ввод:
long n = 3;
Ожидаемый вывод:
long expected = 11;
Пояснение
"one", "two" and "three" have 3 + 3 + 5 = 11 letters.
Ввод:
n = 21
Ожидаемый вывод:
expected = 121
Ввод:
long long n = 21;
Ожидаемый вывод:
long long expected = 121;
Ввод:
long n = 21;
Ожидаемый вывод:
long expected = 121;
Пояснение
1 to 19 use 106 letters, twenty adds 6 and twenty-one adds 9, for 121.
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Handle 1 to 19 with a table, then the tens words for 20 to 90.
Подсказка 2
A three-digit block is the hundreds word plus "hundred" plus the last two digits.
Подсказка 3
For numbers of 1,000 and up, spell the thousands block, add "thousand", then spell the rest.
Ожидаемая сложность
O(n) time, O(1) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.