13.Roman to Integer

最新推荐文章于 2020-05-15 12:32:37 发布

qq_32984263

最新推荐文章于 2020-05-15 12:32:37 发布

阅读量104

点赞数

分类专栏： leetcode 文章标签：算法 leetcode

本文链接：https://blog.csdn.net/qq_32984263/article/details/83036343

版权

leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

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

水题，对每个字符进行比较，比后面的字符大就加上它的值，小就减去它的值。

int getInteger(char s) {
    switch(s) {
        case 'I':
            return 1;
            break;
        case 'V':
            return 5;
            break;
        case 'X':
            return 10;
            break;
        case 'L':
            return 50;
            break;
        case 'C':
            return 100;
            break;
        case 'D':
            return 500;
            break;
        case 'M':
            return 1000;
            break;
        default:
            return 0;
    }
}

int romanToInt(char* s) {
    int i = 0;
    int result = 0;
    while(i<strlen(s)-1) {
        if (getInteger(s[i]) >= getInteger(s[i+1]) ){
            result+=getInteger(s[i]);
        } else {
            result-=getInteger(s[i]);
        }
        i++;
    }
    result+=getInteger(s[i]);
    return result;
}