Integer 的构造,操作,序列化
这个版本就简洁了很多,从右向左,递归调用处理三位数的情况;
public class Solution {
private final String[] LESS_THAN_20 = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
private final String[] TENS = {"", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
private final String[] THOUSANDS = {"", "Thousand", "Million", "Billion"};
public String numberToWords(int num) {
if(num == 0) return "Zero";
String rst = "";
int highPtr = 0;
while(num != 0){
if(num % 1000 != 0){
rst = helper(num % 1000) + THOUSANDS[highPtr] + " " + rst;
}
num /= 1000;
highPtr ++;
}
return rst.trim();
}
private String helper(int num){
if(num == 0)
return "";
else if(num < 20)
return LESS_THAN_20[num] + " ";
else if(num < 100)
return TENS[num / 10] + " " + helper(num % 10);
else
return LESS_THAN_20[num / 100] + ' ' + "Hundred" + ' ' + helper(num % 100);
}
}这个版本就简洁了很多,从右向左,递归调用处理三位数的情况;
Last updated