Roman to Integer

最新推荐文章于 2022-07-21 15:19:09 发布

adawangyi

最新推荐文章于 2022-07-21 15:19:09 发布

阅读量257

点赞数

分类专栏： leetcode-

leetcode- 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

题目：
Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.
思路：
我们首先来明确一下罗马数字与阿拉伯数字的换算规则：如果当前数字比前一个大，说明这一段的值应该是当前这个值减去上一个值，比如IV = 5 – 1；否则，将当前值加入到结果中，然后开始下一段记录，比如VI = 5 + 1, II=1+1。而罗马数字与阿拉伯数字对应变换是：I对应1，V对应5，X对应10，L对应50，C对应100，D对应500，M对应1000。因此，只需要从前往后读出字符，如果当前数字小于等于前一字符，则加上当前字符对应的数字；而当前数字更大时，减去前一个字符（要减去两倍，因为在前面扫描时已经加上过一次了，实际上不应该加，因此要多减一次）。
代码：

class Solution {
public:
    int romanToInt(string s) {

char c[10][10][10]={{"0","I","II","III","IV","V","VI","VII","VIII","IX"},
                    {"0","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"},
                    {"0","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},
                    {"0","M","MM","MMM"}};

         int num=0,i;

         for(i=0;i<s.size();i++)
         {
             if(s[i]=='I') num+=1;
             if(s[i]=='V') 
             {
                if(i!=0 && s[i-1]=='I') num+=3;
                else num+=5;
             }
             if(s[i]=='X')
             {
                 if(i!=0 && s[i-1]=='I') num+=8;
                 else num+=10;
             }
             if(s[i]=='L')
             {
                 if(i!=0 && s[i-1]=='X') num+=30;
                 else num+=50;
             }
             if(s[i]=='C')
             {
                 if(i!=0 && s[i-1]=='X') num+=80;
                 else num+=100;
             }
             if(s[i]=='D')
             {
                 if(i!=0 && s[i-1]=='C') num+=300;
                 else num+=500;
             }
             if(s[i]=='M')  
             {
                 if(i!=0 && s[i-1]=='C') num+=800;
                 else num+=1000;
             }
         }
         return num;
    }
};