13. 罗马数字转整数
思路:暴力解决,里面有些规律在里面,比如当d[i]<d[i+1]这表明两个是叠加产生的,应该减去。
class Solution {
public:
int romanToInt(string s) {
vector<int>num(s.size());
for(int i=0;i<s.size();i++){
if (s[i] == 'I')
num.push_back(1);
else if (s[i] == 'V')
num.push_back(5);
else if (s[i] == 'X')
num.push_back(10);
else if (s[i] == 'L')
num.push_back(50);
else if (s[i] == 'C')
num.push_back(100);
else if (s[i] == 'D')
num.push_back(500);
else if (s[i] == 'M')
num.push_back(1000);
}
int ans=0;
for(int i=0;i<num.size()-1;i++){
if(num[i]>=num[i+1])
ans+=num[i];
else ans-=num[i];
}
ans=ans+num[num.size()-1];
return ans;
}
};