Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
例如:”DCXXI” -> 621
思路:这道题主要是找到罗马字符和数字间的对应关系,下面是4000以内的罗马字符和数字的对应表:
String[] num1 = {“I”,”II”,”III”,”IV”,”V”,”VI”,”VII”,”VIII”,”IX”};
String[] num10 = {“X”, “XX”,”XXX”,”XL”,”L”,”LX”,”LXX”,”LXXX”,”XC”};
String[] num100 = {“C”,”CC”,”CCC”,”CD”,”D”,”DC”,”DCC”,”DCCC”,”CM”};
String[] num1000 = {“M”,”MM”,”MMM”};
解法一:
我们发现, IV = 4 = (5 + 1) - 2 = V + I - 2, IX = 9 = (10 + 1) - 2 = X + I - 2. 因此,我们每次遇到IV, IX等同类型的字符,就让sum减去相应的数字,然后将string s分成char类型的数组,每个字符都在sum中加上相应的数字。由于indexOf()方法的时间复杂度是O(n),因此,此方法的时间复杂度为O(6n),空间复杂度为O(n).
代码:
public int romanToInt(String s) {
int sum = 0;
if (s.indexOf("IV") != -1) sum -= 2;
if (s.indexOf("IX") != -1) sum -= 2;
if (s.indexOf("XL") != -1) sum -= 20;
if (s.indexOf("XC") != -1) sum -= 20;
if (s.indexOf("CD") != -1) sum -= 200;
if (s.indexOf("CM") != -1) sum -= 200;
char[] c = s.toCharArray();
for(int i = 0; i < c.length; i++) {
if (c[i] == 'I') sum += 1;
if (c[i] == 'V') sum += 5;
if (c[i] == 'X') sum += 10;
if (c[i] == 'L') sum += 50;
if (c[i] == 'C') sum += 100;
if (c[i] == 'D') sum += 500;
if (c[i] == 'M') sum += 1000;
}
return sum;
}
解法二:(最优解法)
思路:如果前一个字符代表的数字比后一个小,则sum减去它代表的数字;如果比后一个大,则加上它代表的数字。用hashmap来做,因此每次查找的时间为O(1),时间复杂度为O(n),空间复杂度为O(1)
public static int romanToInt(String s) {
if (s == null || s.length() == 0)
return -1;
HashMap<Character, Integer> map = new HashMap<Character, Integer>();
map.put('I', 1);
map.put('V', 5);
map.put('X', 10);
map.put('L', 50);
map.put('C', 100);
map.put('D', 500);
map.put('M', 1000);
int len = s.length(), result = map.get(s.charAt(len - 1));
for (int i = len - 2; i >= 0; i--) {
if (map.get(s.charAt(i)) >= map.get(s.charAt(i + 1)))
result += map.get(s.charAt(i));
else
result -= map.get(s.charAt(i));
}
return result;
}