记录LeetCode第三天（Roman to Integer）

最新推荐文章于 2022-11-13 09:45:16 发布

原创最新推荐文章于 2022-11-13 09:45:16 发布 · 127 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Cpp

LeetCode 专栏收录该内容

15 篇文章

订阅专栏

本文详细解析LeetCode罗马数字转整数问题，介绍罗马数字的基本构成及转换规则，分享两种C++实现方法：一种是通过vector存储转换后的数值并进行计算；另一种利用unordered_map简化代码，提高效率。

记录LeetCode第三天（Roman to Integer）

1. 题目

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.

2. 例子

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.

3.代码

第一个是我的，思路简单粗暴而且很长，但是跑的还不算慢叭。。这一段好喜欢vector？？

class Solution {
public:
    int romanToInt(string s) {
        vector<int> a;
        int n = s.size()-1;    
        for(int i=0; i<= n ;++i)//把每一个字符都转换为对应数字
        {
             switch (s[i])
            {
                case 'I': a.push_back(1);
                     break;                
                case 'V': a.push_back(5);
                     break;
                case 'X': a.push_back(10);
                     break;
                case 'L': a.push_back(50);
                     break;
                case 'C': a.push_back(100);
                     break;
                case 'D': a.push_back(500);
                     break;
                case 'M': a.push_back(1000);
                     break;
            }
        }
        int v = a.back();//返回vector最后的一位的值
        for(int j = n-1; j>=0;--j)//从罗马字低位到高位相加（从右到左），如果遇到前面值小于后面值，就减去前面值
        {            
            (a[j]>=a[j+1])? v=v+a[j]:v=v-a[j];
        }
         return v;   
    }
};

这个是讨论区看到一个厉害的大大（caikehe）写的，用了第一天Two Sum的那个unordered_map，代码就很短，速度和内存都差不多吧。

int romanToInt(string s) {
    unordered_map<char, int> myMap = {{'I',1}, {'V',5}, {'X',10}, {'L',50}, {'C',100}, {'D',500}, {'M',1000}};
    int res = myMap[s.back()];
    for (unsigned int i = 1; i < s.size(); i++) {
        if (myMap[s[i-1]] < myMap[s[i]])
            res -= myMap[s[i-1]];
        else
            res += myMap[s[i-1]];
    }
    return res;
}

4 .back() 和 .end() 和.begin()

.back() 就是在代码里面用到那个，意思是取到当前最后一个引用的值（不是指针或者序号）
.end() 就是指向最后一位的再后一位的指针。也就是如果有一个叫做vec 的vector，vec.end()-1就是指向它最后一位的指针，*（vec.end()-1）就是最后一位的值了。
.begin()和.end()对应，是指向vec第一位的指针。*vec.begin()就是它的值啦。

试了一下午还是打不开摄像头唉。。。不想在实验室电脑上再装一个opencv了