zoukankan      html  css  js  c++  java
  • LeetCode13. Roman to Integer

     

    Roman numerals are represented by seven different symbols: I, V, X, L, C, D 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: L = 50, V= 5, III = 3.

    Example 5:

    Input: "MCMXCIV"

    Output: 1994

    Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

     

    package LeetCode;
    
    import java.util.HashMap;
    import java.util.Map;
    /*
    I             1
    V             5
    X             10
    L             50
    C             100
    D             500
    M             1000
    参考https://www.cnblogs.com/TenosDoIt/p/3793503.html
    从最后一个字符开始,如果当前字符对应的数字比上一个数字小,那么就把结果减去当前字符对应的数字,否则加上当前字符对应数字。
     */
    public class L13_Roman2Integer {
        public int romanToInt(String s) {
            Map<Character,Integer> map=new HashMap<Character, Integer>();
            map.put('I',1);
            map.put('V',5);
            map.put('X',10);
            map.put('L',50);
            map.put('C',100);
            map.put('D',500);
            map.put('M',1000);
            int len=s.length();
            int result=map.get(s.charAt(len-1));
            for(int i=len-1;i>0;i--)
                if(map.get(s.charAt(i))>map.get(s.charAt(i-1)))
                    result-=map.get(s.charAt(i-1));
                else
                    result+=map.get(s.charAt(i-1));
            return result;
        }
    }
    
    博客园的编辑器没有CSDN的编辑器高大上啊
  • 相关阅读:
    linux 备份当前文件
    zz Apache 2.2.15 + PHP 5.3.2+ mysql windows环境配置
    zz iframe父子窗口间js方法调用
    批处理命令里获取本机的机器名
    Cache Concurrency Problem False Sharing
    因为添加assembly到GAC引起的Windows Azure Web Role部署失败
    求数组中满足a[i]<a[j]的相距最远的元素
    Dispose模式
    比较汇编指令 LEA 和 MOV
    读写Unicode字符串(UTF8,UTF16…)
  • 原文地址:https://www.cnblogs.com/flowingfog/p/9775889.html
Copyright © 2011-2022 走看看