My short Accepted JAVA solution with HashMap


  • -1
    O
    int result=0;
            HashMap<Character,Integer > map=new HashMap<Character,Integer>();
            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);
            for(int i =0;i<s.length();i++)
                if(i+1<s.length() && map.get(s.charAt(i))<map.get(s.charAt(i+1)))
                	result-=map.get(s.charAt(i));
                else  result+=map.get(s.charAt(i));
            return result;

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.