class Solution {
public int romanToInt(String s) {
int[] nums={1,4,5,9,10,40,50,90,100,400,500,900,1000};
String[] str={"I","IV","V","IX","X","XL","L","XC","C","CD","D","CM","M"};
//思路 这里从前往后都可,注意的是那六个特殊案例,但他们与单个字符之间距离是一样的
//这里另外注意的是: s.charAt(index) ————是一个字符类型
//通过String.valueOf(s.charAt(index))————可转换为字符串
//然额 底层 String.valueOf 底层 new String(data, true);
int j=0;
int out=0;
for(int i=12;i>=0;i--){
while(j<s.length() && String.valueOf(s.charAt(j)).equals(str[i])){
if(i<10){
if((j+1)<s.length() && String.valueOf(s.charAt(j+1)).equals(str[i+2])){
out+=nums[i+1];
j+=2;
break;
}
if((j+1)<s.length() &&String.valueOf(s.charAt(j+1)) .equals(str[i+4])){
out+=nums[i+3];
j+=2;
break;
}
}
out+=nums[i];
++j;
}
}
return out;
}
}
HashMap解法
class Solution {
public int romanToInt(String s) {
int sum = 0;
HashMap<Character,Integer> map = new HashMap<>();
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);
char[] chars = s.toCharArray();
for(int i = 0; i < chars.length; i++){
if(i < chars.length - 1 && map.get(chars[i]) < map.get(chars[i + 1])) sum -= map.get(chars[i]);
else sum += map.get(chars[i]);
}
return sum;
}
}
class Solution {
Map<Character, Integer> symbolValues = new HashMap<Character, Integer>() {{
put('I', 1);
put('V', 5);
put('X', 10);
put('L', 50);
put('C', 100);
put('D', 500);
put('M', 1000);
}};
public int romanToInt(String s) {
int ans = 0;
int n = s.length();
for (int i = 0; i < n; ++i) {
int value = symbolValues.get(s.charAt(i));
if (i < n - 1 && value < symbolValues.get(s.charAt(i + 1))) {
ans -= value;
} else {
ans += value;
}
}
return ans;
}
}