LeetCode――Roman to Integer

Given a roman numeral, convert it to an integer.

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

给定一个罗马数字，把它转换成一个整数。

把罗马数字字符串转换成字符数组先，如下表，每个数字仅对应一个字符，而且字符不一样。故可从头开始取值进行对应。

The Roman Symbols

The Romans used a special method of showing numbers, based on the following symbols:

	public int romanToInt(String s) {
		Map
  
    romans = new HashMap
   
    (); romans.put('I', 1); romans.put('V', 5); romans.put('X', 10); romans.put('L', 50); romans.put('C', 100); romans.put('D', 500); romans.put('M', 1000); char[] ch = s.toCharArray(); int num = 0, val = 0; for (int i = 0; i < ch.length; i++) { val = romans.get(ch[i]); if (i == ch.length - 1 || romans.get(ch[i + 1]) <= val) num += val; else num -= val; } return num; }