LeetCode (力扣) 13. Roman to Integer ( C ) - Easy- 暴力解

关注

原创最新推荐文章于 2026-03-01 17:23:26 发布 156 阅读 AI 写同款· GEO 优化 ›

leetcode打不开-LCPractice:我的LeetCode解决方案 leetcode打不开我几乎完成了 LeetCode 上当前的免费问题。其中一些问题真的很有趣。但到目前为止，我的经验是，真正的面试问题通常比 LeetCode 上的问题更有趣、更有意义。不过，LeetCode 作为一些典型面试问题的“基础”和“工具箱”非常有效。我可能最终会为他们的新书付钱。不是因为我想阅读他们的“官方”解决方案。但仅仅因为我觉得我从这个小网站中受益。我应该回馈一些东西。此外，LeetCode 是一个非常好的代码 Kata，适合那些时不时需要一些常规编码练习的人。当然，为此目的，还有其他网站。在这里，我以相当随意的顺序总结了一些 LeetCode 问题。其中一些是我自己的。他们中的大多数实际上来自其他人，因为坦率地说，我最初的解决方案通常不如他们。 3总和首先对输入数组进行排序。然后将位置固定，并将其他指针从数组的固定位置和尾部移向彼此。然后前进固定位置，再次进行两点搜索。 for fixed from 0 to n-1 { head = fixed + 1 tail = n-1 while (tail > head) { 立即下载

同步发于 JuzerTech 网站，里面有我软、硬件学习的纪录与科技产品开箱，欢迎进去观看。

此题为前一题 LeetCode 12. Integer to Roman 的延伸，这次为给定一个罗马数字转换成阿拉伯数字。

题目与范例如下

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 one's 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
Example 2:

Input: s = "IV"
Output: 4
Example 3:

Input: s = "IX"
Output: 9
Example 4:

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

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].

解题策略为依序拆解，先从前面的 'M' 转换成千，再转换 'CM' , 'CD' 900 和 400，再转换 'D'以此类推。

下方为我的代码

int romanToInt(char * s){
    int num = 0;
    for(int i = 0;i<strlen(s);i++){
        if( s[i] == 'M' ){
            num+=1000;
        }
        
        else if( s[i] == 'C' ){
            if(i+1<strlen(s)){
                if( s[i+1] == 'M' ){
                    num+=900;
                    i++;
                }
                else if( s[i+1] == 'D' ){
                    num+=400;
                    i++;
                }
                else
                    num+=100;
            }
            else{
                num+=100;
            }
        }
        else if( s[i] == 'D' )
            num+=500;
        
        else if( s[i] == 'X' ){
            if(i+1<strlen(s)){
                if( s[i+1] == 'C' ){
                    num+=90;
                    i++;
                }
                else if( s[i+1] == 'L' ){
                    num+=40;
                    i++;
                }
                else
                    num+=10;
            }
            else{
                num+=10;
            }
        }
        else if( s[i] == 'L' )
            num+=50;
        
        else if( s[i] == 'I' ){
            if(i+1<strlen(s)){
                if( s[i+1] == 'X' ){
                    num+=9;
                    i++;
                }
                else if( s[i+1] == 'V' ){
                    num+=4;
                    i++;
                }
                else
                    num+=1;
            }
            else{
                num+=1;
            }
        }
        else if( s[i] == 'V' )
            num+=5;
    }
    return num;
}

下方为时间与空间之消耗

Runtime: 4 ms, faster than 84.35 % of C online submissions for Roman to Integer.

Memory Usage: 5.8 MB, less than 58.45 % of C online submissions for Roman to Integer.

收录于