//13
class Solution {
public:
int romanToInt(string s) {
unordered_map<char, int>mp;
mp['I'] = 1;
mp['V'] = 5;
mp['X'] = 10;
mp['L'] = 50;
mp['C'] = 100;
mp['D'] = 500;
mp['M'] = 1000;
int ans = 0;
for (int i = 0; i < s.size() - 1; i++)
if (mp[s[i]] < mp[s[i + 1]]) ans -= mp[s[i]];
else ans += mp[s[i]];
ans += mp[s.back()];
return ans;
}
};
LeetCode13. 罗马数字转整数
最新推荐文章于 2024-07-19 19:25:43 发布