forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
integer-to-english-words.py
44 lines (38 loc) · 1.49 KB
/
integer-to-english-words.py
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
# Time: O(logn) = O(1), n is the value of the integer, which is less than 2^31 - 1
# Space: O(1)
class Solution(object):
def numberToWords(self, num):
"""
:type num: int
:rtype: str
"""
if num == 0:
return "Zero"
lookup = {0: "Zero", 1:"One", 2: "Two", 3: "Three", 4: "Four", \
5: "Five", 6: "Six", 7: "Seven", 8: "Eight", 9: "Nine", \
10: "Ten", 11: "Eleven", 12: "Twelve", 13: "Thirteen", 14: "Fourteen", \
15: "Fifteen", 16: "Sixteen", 17: "Seventeen", 18: "Eighteen", 19: "Nineteen", \
20: "Twenty", 30: "Thirty", 40: "Forty", 50: "Fifty", 60: "Sixty", \
70: "Seventy", 80: "Eighty", 90: "Ninety"}
unit = ["", "Thousand", "Million", "Billion"]
res, i = [], 0
while num:
cur = num % 1000
if num % 1000:
res.append(self.threeDigits(cur, lookup, unit[i]))
num //= 1000
i += 1
return " ".join(res[::-1])
def threeDigits(self, num, lookup, unit):
res = []
if num / 100:
res = [lookup[num / 100] + " " + "Hundred"]
if num % 100:
res.append(self.twoDigits(num % 100, lookup))
if unit != "":
res.append(unit)
return " ".join(res)
def twoDigits(self, num, lookup):
if num in lookup:
return lookup[num]
return lookup[(num / 10) * 10] + " " + lookup[num % 10]