-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathsolution.cpp
67 lines (60 loc) · 1.87 KB
/
solution.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/**
* 601 / 601 test cases passed.
* Runtime: 8.6 ms
* Memory Usage: 4 MB
*/
class Solution {
public:
string numberToWords(int num) {
if (num == 0) return "Zero";
stack<uint16_t> segms;
for (; num > 0; num /= 1000) {
uint16_t segm = num % 1000;
segms.emplace(segm);
}
string ans;
while (!segms.empty()) {
string words = _3DigitSegm(segms.top());
if (segms.top() != 0)
words += segm_unit[segms.size()];
ans += words;
segms.pop();
}
ans.pop_back();
return ans;
}
private:
string _3DigitSegm(uint16_t segm) {
uint16_t dig = segm % 10;
uint16_t ten = (segm % 100) / 10;
uint16_t thu = segm / 100;
string ret;
if (thu != 0) ret += dict[thu] + " Hundred ";
if (ten == 1) {
ret += dict[ten * 10 + dig] + " ";
return ret;
}
if (ten != 0) {
ret += dict[ten * 10] + " ";
if (dig != 0) ret += dict[dig] + " ";
return ret;
}
if (dig != 0) ret += dict[dig] + " ";
return ret;
}
private:
unordered_map<int, string> dict {
{1, "One"}, {2, "Two"}, {3, "Three"},
{4, "Four"}, {5, "Five"}, {6, "Six"},
{7, "Seven"}, {8, "Eight"}, {9, "Nine"},
{11, "Eleven"}, {12, "Twelve"}, {13, "Thirteen"},
{14, "Fourteen"}, {15, "Fifteen"}, {16, "Sixteen"},
{17, "Seventeen"}, {18, "Eighteen"}, {19, "Nineteen"},
{10, "Ten"}, {20, "Twenty"}, {30, "Thirty"},
{40, "Forty"}, {50, "Fifty"}, {60, "Sixty"},
{70, "Seventy"}, {80, "Eighty"}, {90, "Ninety"},
};
unordered_map<int, string> segm_unit {
{2, "Thousand "}, {3, "Million "}, {4, "Billion "},
};
};