Leetcode 13. Roman to Integer (Easy) (cpp)

最新推荐文章于 2016-12-18 08:12:43 发布

Niko_Ke

最新推荐文章于 2016-12-18 08:12:43 发布

阅读量296

点赞数

本文链接：https://blog.csdn.net/Niko_Ke/article/details/51907931

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Math

40 篇文章 0 订阅

订阅专栏

Leetcode 13. Roman to Integer (Easy) (cpp)

Tag: Math, String

Difficulty: Easy

/*

13. Roman to Integer (Easy)

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

*/
class Solution {
public:
	int romanToInt(string s) {
		int num = ChatoNum(s[0]);
		for (int i = 1; i < s.length(); i++) {
			if (ChatoNum(s[i]) > ChatoNum(s[i - 1])) {
                num += ChatoNum(s[i]) - 2 * ChatoNum(s[i - 1]);
            } else {
                num += ChatoNum(s[i]);
            }
        }
        return num;
    }
    int ChatoNum(char cha) {
        switch (cha) {
            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;
        }
        return 0;  
    }
};