• 面试经典150题——Day17


    一、题目

    13. 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, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 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.

    Example 1:

    Input: s = “III”
    Output: 3
    Explanation: III = 3.
    Example 2:

    Input: s = “LVIII”
    Output: 58
    Explanation: L = 50, V= 5, III = 3.
    Example 3:

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

    Constraints:

    1 <= s.length <= 15
    s contains only the characters (‘I’, ‘V’, ‘X’, ‘L’, ‘C’, ‘D’, ‘M’).
    It is guaranteed that s is a valid roman numeral in the range [1, 3999].

    题目来源: leetcode

    二、题解

    如果小值在大值前面,就减去该值,如果大值在小值前面,直接加上该值

    class Solution {
    public:
        int romanToInt(string s) {
            int n = s.length();
            unordered_map<char,int> map;
            map['I'] = 1;
            map['V'] = 5;
            map['X'] = 10;
            map['L'] = 50;
            map['C'] = 100;
            map['D'] = 500;
            map['M'] = 1000;
            int res = 0;
            for(int i = 0;i < n;i++){
                if(i < n - 1 && map[s[i]] < map[s[i+1]]) res -= map[s[i]];
                else res += map[s[i]];
            }
            return res;
        }
    };
    
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
  • 相关阅读:
    内存映射与物理内存结构
    服务器是什么?它是用来干什么的?
    HummerRisk 入门3:开发手册
    洛谷P2939 [USACO09FEB]Revamping Trails G 题解
    flutter系列之:flutter架构什么的,看完这篇文章就全懂了
    瑞芯微rk3568移植openbmc(三)
    【STM32】TIM2的PWM:脉冲宽度调制
    【uniapp小程序开发】—— 组件封装之【自定义轮播图】
    汇编接口 2.80X86寻址方式
    电脑无法安装软件怎么办?
  • 原文地址:https://blog.csdn.net/weixin_46841376/article/details/133855570