forked from armankhondker/leetcode-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
IntegerToEnglishWords.java
44 lines (35 loc) · 1.44 KB
/
IntegerToEnglishWords.java
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
Convert a non-negative integer to its english words representation.
Given input is guaranteed to be less than 231 - 1.
Example 1:
Input: 123
Output: "One Hundred Twenty Three"
Example 2:
Input: 12345
Output: "Twelve Thousand Three Hundred Forty Five"
//TC: O(N) because the output is porportional to the number of digits in input of length N
//SC: O(1) because the output is just a string
class Solution {
private final String[] LESS_THAN_20 = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"};
private final String[] TENS = {"", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"};
public String numberToWords(int num) {
if(num == 0) return "Zero";
return help(num);
}
public String help(int num) {
String ret = "";
if (num < 20) {
ret = LESS_THAN_20[num];
} else if (num < 100) {
ret = TENS[num / 10] + " " + help(num % 10);
} else if (num < 1000) {
ret = help(num / 100) + " Hundred " + help(num % 100);
} else if (num < 1000000) {
ret = help(num / 1000) + " Thousand " + help(num % 1000);
} else if (num < 1000000000) {
ret = help(num / 1000000) + " Million " + help(num % 1000000);
} else {
ret = help(num / 1000000000) + " Billion " + help(num % 1000000000);
}
return ret.trim();
}
}