-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path13-Roman-to-Integer.java
103 lines (103 loc) · 2.4 KB
/
13-Roman-to-Integer.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
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
class Solution {
public int romanToInt(String s) {
//char [] chararray = s.toCharArray();
int sum = 0;
for(int i = 0 ; i < s.length() ;i++ )
{
switch(s.charAt(i))
{
case 'M':
sum += 1000;
break;
case 'D':
sum += 500;
break;
case 'L':
sum += 50;
break;
case 'V':
sum += 5;
break;
case 'C':
if((i+1) < s.length())
{
if(s.charAt(i+1) == 'D')
{
sum += 400;
i++;
break;
}
if(s.charAt(i+1) == 'M')
{
sum += 900;
i++;
break;
}
else
{
sum += 100; //original value;
break;
}
}
else
{
sum += 100; //original value;
break;
}
case 'X':
if((i+1) < s.length())
{
if(s.charAt(i+1) == 'L')
{
sum += 40;
i++;
break;
}
if(s.charAt(i+1) == 'C')
{
sum += 90;
i++;
break;
}
else
{
sum += 10; //original value;
break;
}
}
else
{
sum += 10; //original value;
break;
}
case 'I':
if((i+1) < s.length())
{
if(s.charAt(i+1) == 'V')
{
sum += 4;
i++;
break;
}
if(s.charAt(i+1) == 'X')
{
sum += 9;
i++;
break;
}
else
{
sum += 1; //original value;
break;
}
}
else
{
sum += 1; //original value;
break;
}
}
}
return sum;
}
}