forked from kdn251/interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathintegerToEnglishWords.java
More file actions
68 lines (37 loc) · 1.77 KB
/
Copy pathintegerToEnglishWords.java
File metadata and controls
68 lines (37 loc) · 1.77 KB
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
68
// 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"
public 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" };
private final String[] THOUSANDS = { "", "Thousand", "Million", "Billion" };
public String numberToWords(int num) {
if(num == 0) return "Zero";
int i = 0;
String words = "";
while(num > 0) {
if(num % 1000 != 0) {
words = helper(num % 1000) + THOUSANDS[i] + " " + words;
}
num /= 1000;
i++;
}
return words.trim();
}
private String helper(int num) {
if(num == 0) {
return "";
}
else if(num < 20) {
return LESS_THAN_20[num] + " ";
}
else if(num < 100) {
return TENS[num / 10] + " " + helper(num % 10);
}
else {
return LESS_THAN_20[num / 100] + " Hundred " + helper(num % 100);
}
}
}