Leetcode 13. 罗马数字转整数 map用法

class Solution {
public:
    int romanToInt(string s) {
       map<char,int> map1;
	map1['I']=1;
	map1['V']=5;
	map1['X']=10;
	map1['L']=50;
	map1['C']=100;
	map1['D']=500;
	map1['M']=1000;
	int ans=0;
	for(int i=0;i<s.length();i++){
         map<char,int>::iterator it;; 
        	it=map1.find(s[i]);
            int val=it->second;
        	int nextval=i<s.length()-1?map1.find(s[i+1])->second:0;
        	ans+=val<nextval?-val:val;
		}
		return ans;
    }
};