Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
public class Solution {
public int romanToInt(String s) {
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);
int sum = map.get(s.charAt(s.length()-1));
for(int i=s.length()-1; i>0 ;i--){
if(map.get(s.charAt(i))>map.get(s.charAt(i-1))){
sum -= map.get(s.charAt(i-1));
}else{
sum += map.get(s.charAt(i-1));
}
}
return sum;
}
}
总结:本题只要知道对应的字符代表多少就行(然而我并不知道,参考的别人),把他们放入HashMap里面,如果大数在后就大数减去小数。