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"
1 public class Solution { 2 private final String[] belowTwenty = new String[] {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", 3 "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"}; 4 private final String[] belowHundred = new String[] {"", "", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"}; 5 6 public String numberToWords(int num) { 7 if (num == 0) { 8 return "Zero"; 9 } 10 return helper(num); 11 } 12 13 private String helper(int num) { 14 String result = new String(); 15 if (num < 20) { result = belowTwenty[num]; } 16 else if (num < 100) { result = belowHundred[num / 10] + " " + helper(num % 10); } 17 else if (num < 1000) { result = helper(num / 100) + " Hundred " + helper(num % 100); } 18 else if (num < 1000000) { result = helper(num / 1000) + " Thousand " + helper(num % 1000); } 19 else if (num < 1000000000) { result = helper(num / 1000000) + " Million " + helper(num % 1000000); } 20 else result = helper(num / 1000000000) + " Billion " + helper(num % 1000000000); 21 return result.trim(); 22 } 23 }
Reference:
http://blog.welkinlan.com/2015/09/29/integer-to-english-words-leetcode-java/