Java
public class Solution {
public int romanToInt(String s) {
int res=0;
if(s.length()==0) return 0;
int[] radix = {1000, 500, 100, 50, 10, 5, 1};
char[] symbol = {'M', 'D', 'C', 'L', 'X', 'V', 'I'};
HashMap<Character,Integer> map = new HashMap<Character,Integer>();
for(int i=0; i<radix.length; i++){
map.put(symbol[i],i);
}
for(int i=0; i<s.length()-1;i++){
int cur = map.get(s.charAt(i)), next = map.get(s.charAt(i+1));
if(cur>next) res = res-radix[cur];
else res+=radix[cur];
}
res+=radix[map.get(s.charAt(s.length()-1))];
return res;
}
}
python
class Solution(object):
def romanToInt(self, s):
"""
:type s: str
:rtype: int
"""
numerals = { "M": 1000, "D": 500, "C": 100, "L": 50, "X": 10, "V": 5, "I": 1 }
result = 0
for i in range(len(s)-1):
if numerals[s[i]]<numerals[s[i+1]]:
result-=numerals[s[i]]
else:
result+=numerals[s[i]]
result+=numerals[s[-1]]
return result
class Solution(object):
def romanToInt(self, s):
"""
:type s: str
:rtype: int
"""
radix = [1000, 500, 100, 50, 10, 5, 1];
symbol = ["M", "D", "C", "L", "X", "V", "I"];
result=0;
for i in range(len(s)-1):
if symbol.index(s[i]) > symbol.index(s[i+1]):
result-=radix[symbol.index(s[i])]
else:
result+=radix[symbol.index(s[i])]
result+=radix[symbol.index(s[len(s)-1])]
return result