forked from javadev/LeetCode-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
65 lines (62 loc) · 1.82 KB
/
Solution.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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package g0001_0100.s0012_integer_to_roman;
// #Medium #String #Hash_Table #Math #2024_02_11_Time_2_ms_(100.00%)_Space_44.1_MB_(80.61%)
public class Solution {
public String intToRoman(int num) {
StringBuilder sb = new StringBuilder();
int m = 1000;
int c = 100;
int x = 10;
int i = 1;
num = numerals(sb, num, m, ' ', ' ', 'M');
num = numerals(sb, num, c, 'M', 'D', 'C');
num = numerals(sb, num, x, 'C', 'L', 'X');
numerals(sb, num, i, 'X', 'V', 'I');
return sb.toString();
}
private int numerals(StringBuilder sb, int num, int one, char cTen, char cFive, char cOne) {
int div = num / one;
switch (div) {
case 9:
sb.append(cOne);
sb.append(cTen);
break;
case 8:
sb.append(cFive);
sb.append(cOne);
sb.append(cOne);
sb.append(cOne);
break;
case 7:
sb.append(cFive);
sb.append(cOne);
sb.append(cOne);
break;
case 6:
sb.append(cFive);
sb.append(cOne);
break;
case 5:
sb.append(cFive);
break;
case 4:
sb.append(cOne);
sb.append(cFive);
break;
case 3:
sb.append(cOne);
sb.append(cOne);
sb.append(cOne);
break;
case 2:
sb.append(cOne);
sb.append(cOne);
break;
case 1:
sb.append(cOne);
break;
default:
break;
}
return num - (div * one);
}
}