Leetcode185: Integer to English Words

最新推荐文章于 2024-06-28 09:09:56 发布

银色子弹lx

最新推荐文章于 2024-06-28 09:09:56 发布

阅读量308

点赞数

分类专栏： c++ leetcode 文章标签： leetcode algorithm

c++ 同时被 2 个专栏收录

244 篇文章 0 订阅

订阅专栏

leetcode

243 篇文章 0 订阅

订阅专栏

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:

Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.
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.
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)

思路很普通：

2^31 = 2 147 483 648，

我们可以将数字转化成字符串后，每3个字符分为1组，整体字符串无非就是每组数字构成的串+“Billion/Million/Thousand”之类；可以自定义一个子函数来求3位以内的数的英文表示，这里需要提前将0-9、10-19、20、30、40、...、90之类的英文表示存入数组中，以便利用下标来访问，有点儿哈希的意思。

class Solution {
public:
    string numberToWords(int num) {
        string res = convertHundred(num % 1000);
        vector<string> v = {"Thousand", "Million", "Billion"};
        for (int i = 0; i < 3; ++i) {
            num /= 1000;
            res = num % 1000 ? convertHundred(num % 1000) + " " + v[i] + " " + res : res;
        }
        while (res.back() == ' ') res.pop_back();
        return res.empty() ? "Zero" : res;
    }
    string convertHundred(int num) {
        vector<string> v1 = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
        vector<string> v2 = {"", "", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
        string res;
        int a = num / 100, b = num % 100, c = num % 10;
        res = b < 20 ? v1[b] : v2[b / 10] + (c ? " " + v1[c] : "");
        if (a > 0) res = v1[a] + " Hundred" + (b ? " " + res : "");
        return res;
    }
};