package leetcode; import java.util.HashMap; import java.util.Map; class Solution2 { public int romanToInt1(String s) { Map<Character, Integer> map = 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); }}; int value=0; for (int i = 0; i < s.length(); i++) { if(i<s.length()-1 && map.get(s.charAt(i)) < map.get(s.charAt(i+1))) value-=map.get(s.charAt(i)); else value+=map.get(s.charAt(i)); } return value; } } public class romanToInt { public static void main(String[] args) { Solution2 solution = new Solution2(); System.out.println(solution.romanToInt1("IVII")); } }
力扣罗马数字转整数java
最新推荐文章于 2024-07-20 23:55:03 发布