LeetCode Search a 2D Matrix II

LeetCode Search a 2D Matrix II

题目

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)

代码

const string threeDigits[5] = { "", " Thousand", " Million", " Billion", " Trillion" };
const string units[20] = { "", " One", " Two", " Three", " Four", " Five", " Six", " Seven", " Eight", " Nine", " Ten", " Eleven", " Twelve", " Thirteen", " Fourteen", " Fifteen", " Sixteen", " Seventeen", " Eighteen", " Nineteen" };
const string tens[10] = { "", " Ten", " Twenty", " Thirty", " Forty", " Fifty", " Sixty", " Seventy", " Eighty", " Ninety" };

class Solution {
public:
    string numberToWords(int num) {
        if (num == 0) return "Zero";
        string answer = "";
        int threeDigitsCounter = 0;
        while (num) {
            answer = getThreeDigits(num % 1000) + (num % 1000 ? threeDigits[threeDigitsCounter] : "") + answer;
            num /= 1000;
            threeDigitsCounter++;
        }
        return answer.substr(1, answer.length() - 1);
    }
private:
    string getThreeDigits(int num) {
        if (num == 0) return "";
        string answer = "";
        int hundred = num / 100;
        if (hundred != 0) answer += units[hundred] + " " + "Hundred";
        int ten = num % 100;
        if (ten != 0) {
            if (ten >= 20) {
                answer += tens[ten / 10] + units[ten % 10];
            }
            else {
                answer += units[ten];
            }
        }
        return answer;
    }
};