Data-Structures-and-Algorithms/Java/Leetcode/Leetcode13.java at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/Java/Leetcode/Leetcode13.java at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.6 (299 reviews)
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
packagecom.company;

publicclassLeetcode13 {
publicstaticvoidmain(String[] args) {
Strings="MCMXCIV";
System.out.println(roman(s));
 }


staticintroman(Strings){
intsum=0;
for (inti = 0; i < s.length(); i++) {
if(s.charAt(i)=='I'){
if ( i+1<s.length()) {
if (s.charAt(i + 1) == 'V') {
sum = sum + 4;
i++;
 } elseif (s.charAt(i + 1) == 'X') {
sum = sum + 9;
i++;
 }
else{
sum=sum+1;
 }
 }
else{
sum=sum+1;
 }
 }
elseif(s.charAt(i)=='X' ){
if ( i+1<s.length()) {
if (s.charAt(i + 1) == 'L') {
sum = sum + 40;
i++;
 } elseif (s.charAt(i + 1) == 'C') {
sum = sum + 90;
i++;
 }
else{
sum=sum+10;
 }
 }
else{
sum=sum+10;
 }
 }
elseif(s.charAt(i)=='C'){
if ( i+1<s.length()) {
if (s.charAt(i + 1) == 'D') {
sum = sum + 400;
i++;
 } elseif (s.charAt(i + 1) == 'M') {
sum = sum + 900;
i++;
 }
else{
sum=sum+100;
 }
 }
else{
sum=sum+100;
 }
 }
elseif(s.charAt(i)=='V'){
sum=sum+5;
 }
elseif(s.charAt(i)=='L'){
sum=sum+50;
 }
elseif(s.charAt(i)=='D'){
sum=sum+500;
 }
elseif(s.charAt(i)=='M'){
sum=sum+1000;
 }
 }
returnsum;
 }
}