13. Roman to Integer

最新推荐文章于 2024-01-03 14:43:50 发布

ACLJW

最新推荐文章于 2024-01-03 14:43:50 发布

阅读量420

点赞数

CC 4.0 BY-SA版权

分类专栏：水题 LeetCode

本文链接：https://blog.youkuaiyun.com/qq_37754288/article/details/82085542

水题同时被 2 个专栏收录

44 篇文章

订阅专栏

LeetCode

16 篇文章

订阅专栏

博客提及罗马数字转整数相关内容，这在信息技术领域可能涉及算法实现等方面。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

13. Roman to Integer


int romanToInt(char* s) {
    int dic[26];
    dic['I'-'A'] = 1;
    dic['V'-'A'] = 5;
    dic['X'-'A'] = 10;
    dic['L'-'A'] = 50;
    dic['C'-'A'] = 100;
    dic['D'-'A'] = 500;
    dic['M'-'A'] = 1000;
    int n = 0;
    for(int i = 0;s[i];i++){
        if(s[i+1] && ((s[i] == 'I' && (s[i+1] == 'V' || s[i+1] == 'X'))
                ||(s[i] == 'X' && (s[i+1] == 'L' || s[i+1] == 'C'))
                ||(s[i] == 'C' && (s[i+1] == 'D' || s[i+1] == 'M')))){
            n += dic[s[i+1]-'A'] - dic[s[i]-'A'];
            i++;
        }
        else n += dic[s[i]-'A'];
    }
    return n;
}