Roman to Integer

问题定义

Roman numerals are represented by seven different symbols: IVXLCD and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

  • I can be placed before V (5) and X (10) to make 4 and 9. 
  • X can be placed before L (50) and C (100) to make 40 and 90. 
  • C can be placed before D (500) and M (1000) to make 400 and 900.

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: "III"
Output: 3

Example 2:

Input: "IV"
Output: 4

Example 3:

Input: "IX"
Output: 9

Example 4:

Input: "LVIII"
Output: 58
Explanation: C = 100, L = 50, XXX = 30 and III = 3.

Example 5:

Input: "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

其实就是需要我们进行罗马数字和阿拉伯数字的转换,从例子中可以看到转换规律来。

我的想法是,如果有一个数值比较大的符号处于一个数值小的符号的后面,则要进行特殊计算,而不是全部符号都加起来。

我的思路

我的思路就是用一个map来解决问题,在map中符号和符号代表的数值映射,符号作为key,符号代表的数值作为value。

从低位开始算数,如果判断高位符号的value比临近低位符号的value小,就二者相减。

代码

class Solution {
    public int romanToInt(String s) {
        int sum=0;
        Map<Character,Integer> Roman_Num=new HashMap<>();
        Roman_Num.put('I',1);
        Roman_Num.put('V',5);
        Roman_Num.put('X',10);
        Roman_Num.put('L',50);
        Roman_Num.put('C',100);
        Roman_Num.put('D',500);
        Roman_Num.put('M',1000);
        int i;
        for(i=s.length()-1;i>=0;i--){
            if(i==0) sum=sum+Roman_Num.get(s.charAt(0));
            else if(i==-1) break;
            else{
            char s1=s.charAt(i);
            char s2=s.charAt(i-1);
            if(Roman_Num.get(s1)>Roman_Num.get(s2) )
              {sum=sum+Roman_Num.get(s1)-Roman_Num.get(s2);--i;}
            else sum=sum+Roman_Num.get(s1);
               }
        }
        return sum;
    }
}

学习别人的代码

这是来自与一个名为hongbin2的码友。

public int romanToInt(String s) {
     int sum=0;
    if(s.indexOf("IV")!=-1){sum-=2;}
    if(s.indexOf("IX")!=-1){sum-=2;}
    if(s.indexOf("XL")!=-1){sum-=20;}
    if(s.indexOf("XC")!=-1){sum-=20;}
    if(s.indexOf("CD")!=-1){sum-=200;}
    if(s.indexOf("CM")!=-1){sum-=200;}
    
    char c[]=s.toCharArray();
    int count=0;
    
   for(;count<=s.length()-1;count++){
       if(c[count]=='M') sum+=1000;
       if(c[count]=='D') sum+=500;
       if(c[count]=='C') sum+=100;
       if(c[count]=='L') sum+=50;
       if(c[count]=='X') sum+=10;
       if(c[count]=='V') sum+=5;
       if(c[count]=='I') sum+=1;
       
   }
   
   return sum;
    
}
emmmmmm....貌似比我还简单粗暴吼~

今天就到这里。


题外话:

今天参加了一个笔试,真的越学越觉得缺的知识还挺多的,但是我不怕,一直都要查缺补漏(舍友正经纠正我,是查漏补缺,一样啦~),回头把笔试的一些问题也总结出来。我想找的工作是后端开发(java)啦~加油加油~~~~

阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页