Leetcode-problems-solutions-in-java/RomanToInt.java at master · rimidas75/Leetcode-problems-solutions-in-java · GitHub

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

class RomanToInt {
	public static void main(String[] args) {
		RomanToInt s = new RomanToInt();
		try {
			System.out.println(s.romanToInt("CMXCVIII"));
		} catch (Exception e) {
			e.printStackTrace();
		}
	}


	public int romanToInt(String s) {
		int finalNum = 0;
		for(int i = 0;i<=s.length()-1;i++)
	       {
			// System.out.println(i);
	           char curr = s.charAt(i);
	           if(i<s.length() && i+1 <s.length())
	           {
	           char next = s.charAt(i+1);

	           if(romanCharToInt(curr) >= romanCharToInt(next))
	           {
	        	   finalNum  = finalNum+romanCharToInt(curr);
	        	  /* if(i+1 == s.length()-1)
	        		   finalNum  = finalNum+ romanCharToInt(next);*/
	           }
	           else
	           {
	        	   finalNum  = finalNum - romanCharToInt(curr) +romanCharToInt(next);
	        	   i ++;
	           }
	           }
	           else
	           {
	        	   finalNum  = finalNum+romanCharToInt(curr);
	           }
	          // System.out.println(finalNum);
	       }
		return finalNum;

	}
	public int romanCharToInt(char x)
	{

		 switch(x)
         {
             case 'I':return 1;
             case 'V':return 5;
             case 'X':return 10;
             case 'L':return 50;
             case 'C':return 100;
             case 'D':return 500;
             case 'M':return 1000;
         }
		return 0;
	}
}