[leetcode]13. Roman to Integer

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

yao_yao_2015

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

阅读量204

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/yao_yao_2015/article/details/53906830

版权

leetcode 专栏收录该内容

47 篇文章 1 订阅

订阅专栏

Given a roman numeral, convert it to an integer.

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

int trans(char in)
{
    switch(in)
    {
        case 'I':return 1;
        case 'V':return 5;
        case 'X':return 10;
        case 'L':return 50;
        case 'C':return 100;
        case 'D':return 500;
        case 'M':return 1000;
        default:return 0;
    }
}

int romanToInt(char* s) {
    char roman[7]={'I','V','X','L','C','D','M'};
    int result = 0;
    char tmp;
    int mul;
    for(int i=0; i<strlen(s); i++)
    {
        if(i==strlen(s)-1)
            tmp=NULL;
        else
            tmp=s[i+1];
        mul=1;
        if((s[i]==roman[0]) || (s[i]==roman[2]) || (s[i]==roman[4]))
        {
            if((s[i]==roman[0]) && ((tmp==roman[1])||(tmp==roman[2])))
                mul=-1;
            if((s[i]==roman[2]) && ((tmp==roman[3])||(tmp==roman[4])))
                mul=-1;
            if((s[i]==roman[4]) && ((tmp==roman[5])||(tmp==roman[6])))
                mul=-1;
        }
        result+= trans(s[i]) * mul;
    }
    return result;
}