罗马数字转阿拉伯数字

题目描述：

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.

解决方法：例如，罗马数字VI，我们可以发现它转为阿拉伯数字是6，其实就是5+1，而罗马数字IV是4，其实就是5-1.所以我们在解这道题时，找到最大的数字的罗马字符，字符在这个罗马字符右边的，我们加上它所代表的数字，而位于左边的字符，我们减去它所代表的阿拉伯数字。

首先我们先写个单个罗马字符转为阿拉伯数字的函数

	public static int tovalue(char s){//找到罗马字符对应的数字
		for(int i=0;i<digist.length;i++){
			if(digist[i]==s){
				return values[i];
			}
		}
		return 0;
	}

然后我们需要找到最大罗马字符的下标

	public static int toMaxIndex(String s,int l,int r){//找到最大罗马字符的下标
		int maxIndex=l;//假设最大罗马字符的下标是左边的第一个
		int max=tovalue(s.charAt(l));
		for(int i=l;i<r;i++){
			if(tovalue(s.charAt(i))>max){
				max=tovalue(s.charAt(i));
				maxIndex=i;
			}
		}
		return maxIndex;
	}

最后我们通过递归函数，转为阿拉伯数字。

	public static int turnArabic(String s,int l,int r){
		if(l==r){
			return tovalue(s.charAt(l));
		}
		else if(l>r){//如果l>r，时返回0；
			return 0;
		}
		int mid=toMaxIndex(s, l, r);
		int max=tovalue(s.charAt(mid));
		int left=turnArabic(s, l, mid-1);
		int right=turnArabic(s,mid+1,r);
		return max-left+right;
	}