一开始用的map<char,int>,虽然通过但是时间和空间消耗巨大
之后改成数组,瞬间时间空间消耗下降;
新手的我只能想到用 if 语句判断题中的六个条件;
int romanToInt(string s)
{
int res=0;
int len = s.length();
if (len == 0)
return 0;
int a[27];//26个字母开27的数组足够,而且这里才用到几个字母;
a['I'-'A'] = 1;
a['V'-'A'] = 5;
a['X'-'A'] = 10;
a['L'-'A'] = 50;
a['C'-'A'] = 100;
a['D'-'A'] = 500;
a['M'-'A'] = 1000;
for(int i=0;i<len;i++)
{
if(s[i]=='I')
{
if(s[i+1]=='V')
{
res+=4;
i++;
continue;
}
if(s[i+1]=='X')
{
res+=9;
i++;
continue;
}
}
if(s[i]=='X')
{
if(s[i+1]=='L')
{
res+=40;
i++;
continue;
}
if(s[i+1]=='C')
{
res+=90;
i++;
continue;
}
}
if(s[i]=='C')
{
if(s[i+1]=='D')
{
res+=400;
i++;
continue;
}
if(s[i+1]=='M')
{
res+=900;
i++;
continue;
}
}
res+=a[s[i]-'A'];
}
return res;
}