-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1012. 整数转罗马数字.cpp
107 lines (107 loc) · 1.28 KB
/
1012. 整数转罗马数字.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
class Solution {
public:
string intToRoman(int num) {
string result = "";
if (int i = num/1000)
{
for (int j = 0; j < i; j++)
{
result += 'M';
}
}
num %= 1000;
while (int i = num/100)
{
if (i==9)
{
result += "CM";
break;
}
if (i == 4)
{
result += "CD";
break;
}
if (i>=5)
{
result += 'D';
for (int j = 0; j < i-5; j++)
{
result += 'C';
}
break;
}
else
{
for (int j = 0; j < i; j++)
{
result += 'C';
}
break;
}
}
num %= 100;
while (int i = num/10)
{
if (i == 9)
{
result += "XC";
break;
}
if (i == 4)
{
result += "XL";
break;
}
if (i >= 5)
{
result += 'L';
for (int j = 0; j < i - 5; j++)
{
result += 'X';
}
break;
}
else
{
for (int j = 0; j < i; j++)
{
result += 'X';
}
break;
}
}
num %= 10;
while (int i = num)
{
if (i == 9)
{
result += "IX";
break;
}
if (i == 4)
{
result += "IV";
break;
}
if (i >= 5)
{
result += 'V';
for (int j = 0; j < i - 5; j++)
{
result += 'I';
}
break;
}
else
{
for (int j = 0; j < i; j++)
{
result += 'I';
}
break;
}
}
return result;
}
};