Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.
For example,
123 -> "One Hundred Twenty Three"
12345 -> "Twelve Thousand Three Hundred Forty Five"
1234567 -> "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"
Hint:
- Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.
- Group the number by thousands (3 digits). You can write a helper function that takes a number less than 1000 and convert just that chunk to words.
- There are many edge cases. What are some good test cases? Does your code work with input such as 0? Or 1000010? (middle chunk is zero and should not be printed out)
思路:首先要知道2^31-1,最多是10个digit,也就是最多到billion级别,billion , million, thousand. 2,147,483,647
类似于英文中的,处理1000一下的表达法,高位全部是由1000表达法来的;
class Solution {
private String[] lessThanTwenty = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
private String[] Tens = {"", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty","Seventy", "Eighty", "Ninety"};
private String[] Hundreds = {"", "Thousand", "Million", "Billion"};
public String numberToWords(int num) {
if(num == 0) {
return "Zero";
}
String word = "";
int i = 0;
while(num != 0) {
if(num % 1000 != 0) {
word = helper(num % 1000) + Hundreds[i] + " " + word;
}
num /= 1000;
i++;
}
return word.trim();
}
private String helper(int num) {
if(num == 0) {
return "";
} else if(num < 20) {
return lessThanTwenty[num] + " ";
} else if(num < 100) {
return Tens[num / 10] + " " + helper(num % 10);
} else {
// 100 < num < 1000;
return lessThanTwenty[num / 100] + " Hundred " + helper(num % 100);
}
}
}