LeetCode算法练习之罗马数字转整数

最新推荐文章于 2024-02-22 08:00:00 发布

NONAME7246

最新推荐文章于 2024-02-22 08:00:00 发布

阅读量149

点赞数

分类专栏：算法 C++

本文链接：https://blog.csdn.net/NONAME7246/article/details/104851411

版权

算法同时被 2 个专栏收录

40 篇文章 0 订阅

订阅专栏

C++

32 篇文章 0 订阅

订阅专栏

这道题目不难，就是麻烦，分析好条件一步一步去匹配就好。

class Solution {
public:
    int romanToInt(string s) {
        int strLength = s.size();
        int res = 0;
        for(int i=0;i<s.size();i++){
            if(s[i] == 'I'){
                if(i+1<s.size()&&s[i+1] == 'V'){
                    res += 4;
                    i++;
                    continue;
                }else if(i+1<s.size()&&s[i+1] == 'X'){
                    res += 9;
                    i++;
                    continue;
                }
                else{
                    res+=1;
                    continue;
                }
            }else if(s[i] == 'V'){
                res +=5;
            }else if(s[i] == 'X'){
                if(i+1<s.size()&&s[i+1] == 'L'){
                    res +=40;
                    i++;
                    continue;
                }else if(i+1<s.size()&&s[i+1] == 'C'){
                    res +=90;
                    i++;
                    continue;
                }else {
                    res +=10;
                    continue;
                }
            }else if(s[i] == 'L'){
                res += 50;
            }else if(s[i] == 'C'){
                if(i+1<s.size()&&s[i+1] == 'D'){
                    res +=400;
                    i++;
                    continue;
                }else if(i+1<s.size()&&s[i+1] == 'M'){
                    res +=900;
                    i++;
                    continue;
                }else {
                    res += 100;
                    continue;
                }
            }else if(s[i] == 'D'){
                res += 500;
                continue;
            }else if(s[i] == 'M'){
                res += 1000;
                continue;
            }
        }
    return res;
    }
};