LeetCode273:Integer to English Words

Problem

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"

解题思路：按照我们平时读英文数字的方式进行划分，三位一组，除最低3位之外，高位的每3位只需按对应的3位数读法加上相应的单位，如thousand, million,billion. 因此只需对该数字按三位一组分组，若到高位时一组不足3位可以用0补齐。然后问题即转化为三位数的数字如何读的问题，但是有几点需要注意。1：若数字以0开头，前面的0不能读 2.两位数的一些读法需要单独列出，如1-19需要列出{One,Two,.....Nineteen},每个整10的读法也需列出。

代码如下：

public class Solution {
    public String numberToWords(int num) {
        //
        if(num==0)
          return "Zero";
        String snum=Integer.toString(num);
        int com_groups=snum.length()/3;  //表示完整的3位一组的组数
        List<String> gstring=new ArrayList<String>();
        if(snum.length()%3!=0){
            gstring.add(snum.substring(0,snum.length()%3));
        }
        int i=1;
        int start=snum.length()%3;
        while(i<=com_groups){
            gstring.add(snum.substring(start,start+3));
            start+=3;
            i++;
        }
        StringBuffer s=new StringBuffer("");
        int t_group=gstring.size();
        for(int j=0;j<t_group;j++){
            s.append(Helper(gstring.get(j),t_group-j));
        }
        String res=s.toString();
        return res.substring(0,res.length()-1);
        
    }
    public String Helper(String s,int gnum){
        String[] ones={"","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thirteen","Fourteen",
            "Fifteen","Sixteen","Seventeen","Eighteen","Nineteen","Twenty"};
        String[] tens = {"Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
        StringBuffer ss=new StringBuffer("");
        if(s.length()==1)  //对于一位和两位的情况进行补全
            s="00"+s;
        if(s.length()==2)
            s="0"+s;
        if(s.equals("000"))
          return "";
        if(s.charAt(0)!='0')
          ss.append(ones[s.charAt(0)-'0']+" "+"Hundred"+" ");
        if(s.charAt(1)=='0'){
            if(s.charAt(2)!='0')
                ss.append(ones[s.charAt(2)-'0']+" ");
            }
        else if(s.charAt(1)=='1')
                 ss.append(ones[Integer.parseInt(s.substring(1,3))]+" ");
        else{
              ss.append(tens[s.charAt(1)-'2']+" ");
              if(s.charAt(2)!='0')
              ss.append(ones[s.charAt(2)-'0']+" ");}
        switch(gnum){
            case 4: ss.append("Billion ");break;
            case 3: ss.append("Million ");break;
            case 2: ss.append("Thousand ");break;
            case 1: ss.append("") ;
        }
        return ss.toString();
    }
}

这只是该题的一种解题思路。Discuss中有网友给出一种十分简洁的递归算法。思路是先读取>=1000000000部分(如果存在),然后递归读取<1000000000部分，依次类推，感兴趣同学可以看一下。