题目:罗马数字转换为整数
(此方法效率低)
public
int romanToInt(String s) {
String[] sArray =
s.split("");
int sum=0;
int[] nums=new int[s.length()];
for(int i=0;i<s.length();i++){
switch (s.charAt(i)){
case 'M':
nums[i]=1000;
break;
case 'D':
nums[i]=500;
break;
case 'C':
nums[i]=100;
break;
case 'L':
nums[i]=50;
break;
case 'X' :
nums[i]=10;
break;
case 'V':
nums[i]=5;
break;
case 'I':
nums[i]=1;
break;
}
}
for(int j=0;j<nums.length-1;j++){
if(nums[j]>=nums[j+1])
sum=sum+nums[j];
else
sum=sum-nums[j];
}
return sum+nums[nums.length-1];
}