zoukankan      html  css  js  c++  java
  • [leetcode]13. 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: L = 50, V= 5, III = 3.
    

    Example 5:

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

    Solution1: Simulation

    For most cases, Roman Numeral use addition(相加),  like 6 -> "V I" (which means  previous Roman >  current Roman) 

    result += map(s.charAt(i));

    But a few cases uses subtraction(相减) , like 4->"I V" ( which means previous Roman < current Roman)

    result += (map(s.charAt(i)) - 2 * map(s.charAt(i - 1)));

    code:

     1  /*
     2      Time Complexity: O(n)
     3      Space Complexity: O(1)
     4  */
     5 
     6 class Solution {
     7      public int romanToInt(String s) {
     8         int result = 0;
     9         for (int i = 0; i < s.length(); i++) {
    10             if (i > 0 && map(s.charAt(i)) > map(s.charAt(i - 1))) {
    11                 result += (map(s.charAt(i)) - 2 * map(s.charAt(i - 1)));
    12             } else {// else包含了 i = 0 || map(s.charAt(i))<= map(s.charAt(i-1)))
    13                 result += map(s.charAt(i));
    14             }
    15         }
    16         return result;
    17     }
    18     private static int map(char c) {
    19         switch (c) {
    20             case 'I': return 1;
    21             case 'V': return 5;
    22             case 'X': return 10;
    23             case 'L': return 50;
    24             case 'C': return 100;
    25             case 'D': return 500;
    26             case 'M': return 1000;
    27             default: return 0;
    28         }
    29     }
    30 }
  • 相关阅读:
    创建局域网方案!!!!!--安全的物联网技术方案使用说明与管理
    创建局域网方案!!!!!--交叉编译步骤和使用事项!!
    java学习与应用(1)--基本回顾
    iptables的nat使用记事
    iptables交叉编译记事
    telnet传输文件
    tensorflow零起点快速入门(6) --np与tf
    Sinlinx交叉编译半途记事
    tensorflow零起点快速入门(5) --强化学习摘录截图(tf与np)
    Latex使用记事(1)
  • 原文地址:https://www.cnblogs.com/liuliu5151/p/10659001.html
Copyright © 2011-2022 走看看