LeetCode 13. Roman to Integer

最新推荐文章于 2023-10-30 12:20:17 发布

柳婼

最新推荐文章于 2023-10-30 12:20:17 发布

阅读量447

点赞数

CC 4.0 BY-SA版权

文章标签： LeetCode

本文链接：https://blog.csdn.net/liuchuo/article/details/51993972

LeetCode 专栏收录该内容

350 篇文章

订阅专栏

13. Roman to Integer
My Submissions QuestionEditorial Solution
Total Accepted: 80246 Total Submissions: 205709 Difficulty: Easy
Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

class Solution {
public:
    int romanToInt(string s) {
        int ans = 0;
        map<char, int> m;
        char c[] = {'I', 'V', 'X', 'L', 'C', 'D', 'M'};
        int t[] = {1, 5, 10, 50, 100, 500, 1000};
        for(int i = 0; i < 7; i++) {
            m.insert(pair<char, int> (c[i], t[i]));
        }
        for(int i = 0; i < s.length() - 1; i++) {
            if(m[s[i]] >= m[s[i + 1]]) {
                ans = ans + m[s[i]];
            } else {
                ans = ans - m[s[i]];
            }
        }
        ans = ans + m[s[s.length() - 1]];
        return ans;
    }
};