package com.fishercoder.solutions;

import java.util.HashMap;
import java.util.Map;

/**Given a roman numeral, convert it to an integer.

 Input is guaranteed to be within the range from 1 to 3999.*/
public class _13 {

    public int romanToInt(String s) {
        Map<Character, Integer> map = new HashMap();
        map.put('I', 1);
        map.put('V', 5);
        map.put('X', 10);
        map.put('L', 50);
        map.put('C', 100);
        map.put('D', 500);
        map.put('M', 1000);

        char[] schar = s.toCharArray();
        int result = 0;
        for (int i = 0; i < s.length(); i++) {
            if (i > 0 && map.get(schar[i]) > map.get(schar[i - 1])) {
                result = result + map.get(schar[i]) - 2 * map.get(schar[i - 1]);
            } else {
                result = result + map.get(schar[i]);
            }
        }
        return result;
    }

}

@@ -81,16 +81,47 @@
 ap;%0A%0A/**
+%0A * 13. Roman to Integer%0A *%0A * 
 Given a 
@@ -161,17 +161,18 @@
 nteger.%0A
-%0A
+ *
  Input i
@@ -226,11 +226,16 @@
 999.
+%0A * 
 */%0A
+%0A
 publ

refactor 13