MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / roman

Method roman

Java/Leetcode/Leetcode13.java:10–78  ·  view source on GitHub ↗
(String s)

Source from the content-addressed store, hash-verified

8
9
10 static int roman(String s){
11 int sum=0;
12 for (int i = 0; i < s.length(); i++) {
13 if(s.charAt(i)=='I'){
14 if ( i+1<s.length()) {
15 if (s.charAt(i + 1) == 'V') {
16 sum = sum + 4;
17 i++;
18 } else if (s.charAt(i + 1) == 'X') {
19 sum = sum + 9;
20 i++;
21 }
22 else{
23 sum=sum+1;
24 }
25 }
26 else{
27 sum=sum+1;
28 }
29 }
30 else if(s.charAt(i)=='X' ){
31 if ( i+1<s.length()) {
32 if (s.charAt(i + 1) == 'L') {
33 sum = sum + 40;
34 i++;
35 } else if (s.charAt(i + 1) == 'C') {
36 sum = sum + 90;
37 i++;
38 }
39 else{
40 sum=sum+10;
41 }
42 }
43 else{
44 sum=sum+10;
45 }
46 }
47 else if(s.charAt(i)=='C'){
48 if ( i+1<s.length()) {
49 if (s.charAt(i + 1) == 'D') {
50 sum = sum + 400;
51 i++;
52 } else if (s.charAt(i + 1) == 'M') {
53 sum = sum + 900;
54 i++;
55 }
56 else{
57 sum=sum+100;
58 }
59 }
60 else{
61 sum=sum+100;
62 }
63 }
64 else if(s.charAt(i)=='V'){
65 sum=sum+5;
66 }
67 else if(s.charAt(i)=='L'){

Callers 1

mainMethod · 0.95

Calls 1

lengthMethod · 0.80

Tested by

no test coverage detected