[leetcode 13] Roman to Integer

题目：

Given a roman numeral, convert it to an integer.

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

思路：

1.题目要求将给定的罗马数字转换为整数，转换后正数范围为[1,3999]；

2.思路与上篇文章（Integer to Roman）类似，先对千位进行处理，找从头起有几个M(即1000)，然后将这些M去掉，对百位进行处理，从百位string数组的尾开始匹配（从头开始匹配无法准确判断，如匹配到C，无法确定这一位为1，2，还是3），匹配成功则停止，将匹配到的子串去掉，对十位进行处理，直到处理完个位；

3.思路简单，可直接看代码（算法简单，代码未优化）。

代码：

class Solution{
public:
	int romanToInt(string s){
		int result=0;
		string bit[9]={"I","II","III","IV","V","VI","VII","VIII","IX"};
		string dec[9]={"X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
		string hun[9]={"C","CC","CCC","CD","D","DC","DCC","DCCC","CM"};
		string kbit="M";
		while((s[0]=='M') && (s!=" "))
		{
			++result;
			s=s.substr(1,s.size()-1);
		}
		if(result>0)
			result*=1000;
		for(int i=8;i>=0;--i)
		{
			int idx=s.find(hun[i]);
			if(idx==0)
			{
				result+=(i+1)*100;
				s=s.substr(hun[i].size(),s.size()-hun[i].size());
				break;
			}
		}
		for(int i=8;i>=0;--i)
		{
			int idx=s.find(dec[i]);
			if(idx==0)
			{
				result+=(i+1)*10;
				s=s.substr(dec[i].size(),s.size()-dec[i].size());
				break;
			}
		}
		for(int i=8;i>=0;--i)
		{
			int idx=s.find(bit[i]);
			if(idx==0)
			{
				result+=(i+1);
				s=s.substr(bit[i].size(),s.size()-bit[i].size());
				break;
			}
		}
		return result;
	}
};