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)
题目:将整形数字转化为英文单词表述。
思路:根据题目提示,将3位数字分为一组,而且题目中限定了输入数字范围为0到231 - 1之间,最高只能到billion位,3个一组也只需处理四组即可。
将0-19和20,30,40,50,60,70,80,90对应的单词存入数组,同时将"Thousand", "Million", "Billion"存入数组,最后在相应的分组后面加入。
注意:拼接字符串时候的空格控制!
代码如下(如有好的思路,大家相互交流哦~):
static public String numberToWords(int num) {
String[] temp=new String[]{"","","",""};
String[] flag=new String[]{ "","Thousand","Million","Billion"};
String result="";
int count=0;
while(num!=0){
temp[count++]=helpToGroup(num%1000);
num/=1000;
}
for(int i=count-1;i>=0;i--){
if(temp[i].length()!=0){
result+=temp[i]+" "+flag[i]+" ";
}
}
if(result.length()==0){
return "Zero";
}
return result.trim();
}
private static String helpToGroup(int num){
String []flag=new String[]{"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
String [] hundred =new String[]{"","","Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
String result = "";
result+=flag[num/100];
if(result.length()!=0){
result+=" Hundred ";
}
int remain=num%100;
if(remain<20)
result+=flag[remain];
else {
result+=hundred[remain/10]+" "+flag[remain%10];
}
return result.trim();
}