[LeetCode] Integer to English Words

简介: Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231−12^{31} - 1.For example, 123 -> “One Hundred Twenty Three” 1234

Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 2311.

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”

解题思路

略。

实现代码

// Runtime: 8 ms
class Solution {
public:
    string numberToWords(int num) {
        return num2str(num);
    }

private:
    string num2str(int num)
    {
        string res = "";
        if (num <= 19)
        {
            res += nums[num];
        }
        else if (num <= 99)
        {
            res += tens[num / 10];
            if (num % 10 != 0)
            {
                res += " ";
                res += num2str(num % 10);
            }
        }
        else if (num <= 999)
        {
            res += num2str(num / 100);
            res += " Hundred";
            if (num % 100 != 0)
            {
                res += " ";
                res += num2str(num % 100);
            }
        }
        else if (num <= 999999)
        {
            res += num2str(num / 1000);
            res += " Thousand";
            if (num % 1000 != 0)
            {
                res += " ";
                res += num2str(num % 1000);
            }
        }
        else if (num <= 999999999)
        {
            res += num2str(num / 1000000);
            res += " Million";
            if (num % 1000000 != 0)
            {
                res += " ";
                res += num2str(num % 1000000);
            }
        }
        else if (num <= 999999999999)
        {
            res += num2str(num / 1000000000);
            res += " Billion";
            if (num % 1000000000 != 0)
            {
                res += " ";
                res += num2str(num % 1000000000);
            }
        }

        return res;
    }

    string tens[10] = {"", "", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};

    string nums[20] = {"Zero", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight",
        "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen",
        "Eighteen", "Nineteen"};
};
目录
相关文章
|
索引 Python
LeetCode 820. 单词的压缩编码 Short Encoding of Words
LeetCode 820. 单词的压缩编码 Short Encoding of Words
LeetCode 273. Integer to English Words
将非负整数转换为其对应的英文表示。可以保证给定输入小于 231 - 1 。
35 0
LeetCode 273. Integer to English Words
|
Java 索引 Python
LeetCode 151:给定一个字符串,逐个翻转字符串中的每个单词 Reverse Words in a String
公众号:爱写bug(ID:icodebugs) 翻转字符串里的单词 Given an input string, reverse the string word by word. 示例 1: 输入: "the sky is blue" 输出: "blue is sky the" 示例 2: 输入: " hello world! " 输出: "world! hello" 解释: 输入字符串可以在前面或者后面包含多余的空格,但是反转后的字符不能包括。
1553 0

热门文章

最新文章