Roman to Integer

leetcode 的第13题，题目如下：

• List item
• 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: L = 50, V= 5, III = 3.
Example 5:

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

解题思路：找出特殊值，像IV IX XL XC CD CM,分别是4，9，40，90，400，900，为了方便，在一个字符串中，全是做加法，但一出现这样的组合，则分别-2，-2，-20，-20，-200，-200。比如143----CXLIII————100+10+50+3-20=143。
java代码如下：

1. List item
2. public class Solution{

3. 	pubilc int romanToInt(String input){
   

4. 			if(input==null	||input.length()==0)		return 0;
   

5. 			int result=0;
   

6. 			if(input.indexOf("CM")!=-1)		result-=200;  
   

7. 			if(***input.indexOf("CD")***!=-1)		result=-200;   ***//查看某子字符串是否在父字符串的方法***
   

8. 			if(input.indexOf("XC")!=-1)			result=-20;
   

9. 			if(input.indexOf("XL")!=-1)			result-=20;
   

10.    	if(input.indexOf("IX")!=-1)			result-=2;
    

11.    	if(input.indexOf("IV")!=-1)			result-=2;
    

12.    	***for(char c: input.toCharArray())***{  ***//将字符串转化给字符从数组的方法，并且循环***
    

13.    			if(c=="M")		result+=1000;
    

14.    			else if(c=="D")				result+=500;
    

15.    			else if(c=="C")			result+=100;
    

16.    			else if(c=="L")			result+=50;
    

17.    			else if(c=="X")				result+=10;
    

18.    			else if(c=="V")			result+=5;
    

19.    			else if(c=="I")					result+=1;
    

20.    		}
    

21.    		return result;
    

22.    }
    

23. }
    思路二：在罗马数字中，如果左边的数字小于右边的，则需要做减法，大于或等于，则需要做加法。代码如下：
24. List item
25. pubilc class Solution{

26.    	public int romanToInt(String s){
    

27.    			if(s.length()<1)		return 0;
    

28.    			int result=0;
    

29.    			int sub=getRomanValue(s.charAt(0));
    

30.    			int lastv=sub;
    

31.    			for(int i=1;i<s.length();++i){
    

32.    					char curc=s.charAt(i);
    

33.    					int curv=getRomanValue(curc);
    

34.    					if(curv==lastv)
    

35.    								sub+=curv;
    

36.    					else if(curv<lastv){
    

37.    								result+=sub;
    

38.    								sub=curv;
    

39.    					}else{
    

40.    								sub=curv-sub;
    

41.    					}
    

42.    					lastv+=curv;
    

43.    				}
    

44.    				result+=sub;
    

45.    				return result;
    

46.    		}
    

47.    		public int getRomanValue(char c){
    

48.    				switch(c){
    

49.    						case ‘I’: return 1;
    

50.    						case ‘V':return 5;
    

51.    						case 'X':return 10;
    

52.    						case 'L':return 50;
    

53.    						case 'C':return 100;
    

54.    						case 'D':reutn 500;
    

55.    						case 'M':return 1000;
    

56.    						default:return 0;
    

57.    				}
    

58.    			}
    

59. }
    参考教程：篮子王