[leetcode]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: C = 100, L = 50, XXX = 30 and III = 3.

Example 5:

Input: "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

这次是把罗马转换成数字，这次就比较简单了，只要匹配到字符I,X,C的时候，注意一下后面那一位是不是V,X;L,C；D,M就行了，这样特殊处理就OK了。

代码如下：

#include <iostream>
#include <string>
using namespace std;

class ptlist
{
private:
	string roman;
	int number;

public:
	ptlist() {

	}

	void set(string roman, int number) {
		this->roman = roman;
		this->number = number;
	}

	int getNumber() {
		return number;
	}

	string getRoman() {
		return roman;
	}

}ptl[13];

void setptl()
{
	//设置数组
	ptl[0].set("M", 1000);
	ptl[1].set("CM", 900);
	ptl[2].set("D", 500);
	ptl[3].set("CD", 400);
	ptl[4].set("C", 100);
	ptl[5].set("XC", 90);
	ptl[6].set("L", 50);
	ptl[7].set("XL", 40);
	ptl[8].set("X", 10);
	ptl[9].set("IX", 9);
	ptl[10].set("V", 5);
	ptl[11].set("IV", 4);
	ptl[12].set("I", 1);
}

int counter[13] = {};

class Solution 
{
public:
	int romanToInt(string s) {
		setptl();
		s += "0";
		for (int i = 0; i < 13; i++) {
			counter[i] = 0;
		}
		int result = 0;
		for (int i = 0; i < s.size(); i++) {
			if (s[i] == 'M') counter[0]++;
			if (s[i] == 'D') counter[2]++;
			if (s[i] == 'L') counter[6]++;
			if (s[i] == 'V') counter[10]++;

			if (s[i] == 'C') {
				if (s[i + 1] == 'M') {
					counter[1]++;
					i++; 
				}
				else if (s[i + 1] == 'D') {
					counter[3]++; 
					i++;
				}
				else counter[4]++;	
			}

			if (s[i] == 'X') {
				if (s[i + 1] == 'C') {
					counter[5]++;
					i++;
				}
				else if (s[i + 1] == 'L') {
					counter[7]++;
					i++;
				}
				else counter[8]++;
			}

			if (s[i] == 'I') {
				if (s[i + 1] == 'X') {
					counter[9]++;
					i++;
				}
				else if (s[i + 1] == 'V') {
					counter[11]++;
					i++;
				}
				else counter[12]++;
			}

		}

		for (int i = 0; i < 13; i++) {
			result += counter[i] * ptl[i].getNumber();
		}
		return result;
	}

};

leetcode的提交是不用写main函数的。。当然我自己在vs调试还是需要自己写的。。

值得注意是一定要在leetcode初始化counter数组。我自己调试的时候没问题，提交一直报错。。