문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.