题目:是12题的逆向,给定一个罗马数字string转换成int型。难度不大。
1。按照12题的数组,考虑到要查找是否存在某子串及对应的数值,想到map,建立子string对应数值的map。也可以建立char->int的map,用map[s[i]]<map[s[i+1]]?来判定是否有4,9类型的罗马。
class Solution
{
public:
int romanToInt(string s)
{
int res=0;
string roman[]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
int value[]={1000,900,500,400,100,90,50,40,10,9,5,4,1};
map <string,int> mp;
for(int i=0;i<sizeof(value)/sizeof(int);++i)
mp[string(roman[i])]=value[i];
for(int i=0;i<s.size();++i)
{
string tmp1,tmp2;
tmp1+=s[i];
if(i!=s.size()-1)
{
tmp2=tmp1+s[i+1];
if(mp.count(tmp2)!=0)
{
res+=mp[tmp2];
i++;
}//如果有CM这种2个字符构成的罗马值。
else
res+=mp[tmp1];
}
else
res+=mp[tmp1];
}
return res;
}
};