【C++编程】C++ unordered_map

class Solution {
public:    
       int romanToInt(string s) {        
       //int res(0);        
       unordered_map<string, int> m = {{"I", 1}, {"IV", 3}, {"IX", 8}, {"V", 5}, {"X", 10}, {"XL", 30}, {"XC", 80}, {"L", 50}, {"C", 100}, {"CD", 300}, {"CM", 800}, {"D", 500}, {"M", 1000}};        
       int res = m[s.substr(0,1)];        
       for(int i = 1; i < int(s.size()); i++){            
       		string oneChar = s.substr(i,1);            
       		string twoChar = s.substr(i-1,2);            
       		res += (m[twoChar]?m[twoChar]:m[oneChar]);         
       }
       return res;    
   }
};

unordered_map<string, int> m={ }; //用于构建 string int 型词典
int res = m[s.substr(0,1)]; //m[s.substr(0,1)]用于查询字典中是否有这个string，若有，则返回相应得value。