zoukankan      html  css  js  c++  java
  • *Integer to English Words

    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:

    1. Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.
    2. 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.
    3. 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)
     1 public class Solution {
     2 public String numberToWords(int num) {
     3     if (num == 0) return "Zero";
     4     String[] big= {"", "Thousand", "Million", "Billion"};
     5     String[] small = {"Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
     6     String[] tens = {"Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
     7     String[] ones = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"};
     8     StringBuilder res = new StringBuilder();
     9     int count = 0;
    10     while (num != 0) {
    11         int cur = num % 1000;
    12         int o = cur % 10, t = (cur / 10) % 10, h = cur / 100;
    13         StringBuilder tmp = new StringBuilder();
    14         if (h != 0) tmp.append(ones[h] + " Hundred ");
    15         if (t == 1) tmp.append(small[o] + " ");
    16         else {
    17             if (t > 1) tmp.append(tens[t-2] + " ");
    18             if (o > 0) tmp.append(ones[o] + " ");
    19         }
    20         if(tmp.length() != 0) tmp.append(big[count] + " ");
    21         res.insert(0, tmp);
    22         num /= 1000;
    23         count++;
    24     }
    25     return res.toString().trim();
    26 }
    27 }

     https://leetcode.com/discuss/60010/share-my-clean-java-solution

  • 相关阅读:
    AJAX聊天室小DEMO(讨厌JS,IE下有问题已解决)
    [ZT]线索二叉树(C#数据结构五)
    栈(C#数据结构学习二)
    eclipse 安装 resin 3 步骤
    解决全局utf8编码下asp.net接收gb2312乱码的问题
    模板里的控件要用FindControl(id)方法读取
    OpenSessionInView
    asp:button控件调用js函数不刷新方法
    OFFICE 出现“正在配置”的解决方法
    开发经验
  • 原文地址:https://www.cnblogs.com/hygeia/p/4900111.html
Copyright © 2011-2022 走看看