forked from Annex5061/java-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathromanToInt.java
51 lines (49 loc) · 947 Bytes
/
romanToInt.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
import java.util.Scanner;
class Solution {
public int romanToInt(String s) {
int res = 0;
for (int i = 0; i < s.length(); i++) {
int s1 = value(s.charAt(i));
if (i + 1 < s.length()) {
int s2 = value(s.charAt(i + 1));
if (s1 >= s2) {
res = res + s1;
}
else {
res = res + s2 - s1;
i++;
}
}
else {
res = res + s1;
}
}
return res;
}
int value(char r)
{
if (r == 'I')
return 1;
if (r == 'V')
return 5;
if (r == 'X')
return 10;
if (r == 'L')
return 50;
if (r == 'C')
return 100;
if (r == 'D')
return 500;
if (r == 'M')
return 1000;
return -1;
}
public static void main(String args[]){
Solution ob=new Solution();
Scanner sc=new Scanner(System.in);
System.out.println("Enter a roman number");
String x=sc.nextLine();
int a=ob.romanToInt(x);
System.out.println(a);
}
}