leetcode 013 Roman to Integer（难易度：Easy）

Roman to Integer

Given a roman numeral, convert it to an integer.

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

代码：

int romanCharToInt(char c);
int romanToInt(char* s)
{
	int num = 0;
	int size = strlen(s);
	for (int i = 0; i < size; i++)
	{
		if (i < size - 1 && romanCharToInt(s[i]) < romanCharToInt(s[i + 1]))
			num -= romanCharToInt(s[i]);
		else
			num += romanCharToInt(s[i]);
	}
	return num;
}
int romanCharToInt(char c)
{
	switch (c)
	{
		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;
	}
}

// LeetCode, Roman to Integer
// 时间复杂度 O(n)，空间复杂度 O(1)
class Solution {
public:
	inline int map(const char c) {
		switch (c) {
		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 result = 0;
		for (size_t i = 0; i < s.size(); i++) {
			if (i > 0 && map(s[i]) > map(s[i - 1])) {
				result += (map(s[i]) - 2 * map(s[i - 1]));
			}
			else {
				result += map(s[i]);
			}
		}
		return result;
	}
};

原题地址：https://leetcode.com/problems/roman-to-integer/