
package com.shengda.Demo0Likou;
import java.util.HashMap;
public class Demo13 {
public static void main(String[] args) {
Solution solution = new Solution();
String s = "IV";
int num = solution.romanToInt(s);
System.out.println(num);
}
}
class Solution{
public int romanToInt(String s) {
// 将数值表存入到HashMap里边,然后进行对比
// 通过swich进行获取每个字母对应的值
int num = SetNum(s.charAt(s.length()-1));
for (int i = 0; i < s.length()-1; i++) {
int data1 = SetNum(s.charAt(i));
int data2 = SetNum(s.charAt(i+1));
if (data1欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)