LeetCode | 13. Roman to Integer

最新推荐文章于 2024-09-11 00:15:00 发布

susielau1998

最新推荐文章于 2024-09-11 00:15:00 发布

阅读量109

点赞数

分类专栏：坚持就是胜利文章标签： LeetCode 编程练习打卡

本文链接：https://blog.csdn.net/susielau1998/article/details/85599947

版权

坚持就是胜利专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Description

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.

1. Switch | 枚举大法好

观察发现，由左至右，如果字符位置 i 数字小于字符位置 i+1 数字，则该字符值应为其负数。
例如：IV，I = 1，V = 5。但是I < V，因此I = -1, V = 5，和为4。
先用switch statement枚举每个字符的对应数字，在遍历string时进行判断，是否 i 位置字符数字小于 i+1，再进行符号更换。

class Solution {
public:
    int helper(char s) {
        toupper(s);
        switch (s) {
            case 'I':
                return 1;
            case 'V':
                return 5;
            case 'X':
                return 10;
            case 'L':
                return 50;
            case 'C':
                return 100;
            case 'D':
                return 500;
            case 'M':
                return 1000;
            default:
                return 0;
        }
    }
    
    int romanToInt(string s) {
        int sum = 0;
        for (size_t i = 0; i < s.length(); i++) {
            if (i<s.length()-1 && helper(s[i]) < helper(s[i+1])) {
                sum -= helper(s[i]);
            } else {
                sum += helper(s[i]);
            }
        }
        return sum;
    }
};

2. unordered_map | 数据结构用一用

unordered_map与map的区别在于，储存的数据顺序不再重要（elements not sorted），不需要浪费时间为元素排序。

class Solution {
public:
    
    int romanToInt(string s) {
        unordered_map<char,int> char_int = {{'I',1},{'V',5},{'X',10},{'L',50},{'C',100},{'D',500},{'M',1000}};
        int sum = 0;
        for (size_t i = 0; i < s.length(); i++) {
            if (i<s.length()-1 && char_int[s[i]] < char_int[s[i+1]]) {
                sum -= char_int[s[i]];
            } else {
                sum += char_int[s[i]];
            }
        }
        return sum;
    }
};