leetcode 273. 整数转换英文表示

将非负整数转换为其对应的英文表示。可以保证给定输入小于 2³¹ - 1 。
示例：

输入: 123
输出: "One Hundred Twenty Three"

输入: 12345
输出: "Twelve Thousand Three Hundred Forty Five"

输入: 1234567
输出: "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"

输入: 1234567891
输出: "One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven Thousand Eight Hundred Ninety One"

本题的主要思路是每三个数字一组，最多四组，并搭配"Thousand", “Million”, “Billion”，至于每三位数将其个十百位上的数字表示出来，拼接起来即可，需要注意的是20是一个分界线。
C++

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;
    }
};