fibers
diff --git a/‎src/main/java/com/fibers/algorithm/leetcode/_013/Solution.java
Lines changed: 23 additions & 22 deletions b/‎src/main/java/com/fibers/algorithm/leetcode/_013/Solution.java
Lines changed: 23 additions & 22 deletions
diff --git a/‎src/main/java/com/fibers/algorithm/leetcode/_189/Solution.java
Lines changed: 1 addition & 1 deletion b/‎src/main/java/com/fibers/algorithm/leetcode/_189/Solution.java
Lines changed: 1 addition & 1 deletion
@@ -1,6 +1,6 @@
 package com.fibers.algorithm.leetcode._013;
 
-import java.util.LinkedHashMap;
+import java.util.HashMap;
 import java.util.Map;
 
 public class Solution {
@@ -11,36 +11,37 @@ public static void main(String[] args) {
     }
 
     public int romanToInt(String s) {
-        int result = 0;
-        Map<String, Integer> map = new LinkedHashMap<String, Integer>() {
+
+        Map<Character, Integer> map = new HashMap<Character, Integer>() {
             {
-                put("M", 1000);
-                put("CM", 900);
-                put("D", 500);
-                put("CD", 400);
-                put("C", 100);
-                put("XC", 90);
-                put("L", 50);
-                put("XL", 40);
-                put("X", 10);
-                put("IX", 9);
-                put("V", 5);
-                put("IV", 4);
-                put("I", 1);
+                put('M', 1000);
+                put('D', 500);
+                put('C', 100);
+                put('L', 50);
+                put('X', 10);
+                put('V', 5);
+                put('I', 1);
             }
         };
 
         if (s == null || s.length() == 0) {
             return 0;
         }
 
-        while (s.length() != 0) {
-            for (String key : map.keySet()) {
-                if (s.startsWith(key)) {
-                    result += map.get(key);
-                    s = s.substring(key.length());
-                    break;
+        int result = 0;
+        char[] charArray = s.toCharArray();
+        for (int i = 0; i < charArray.length; i++) {
+            Integer current = map.get(charArray[i]);
+            if (i < charArray.length - 1) {
+                Integer next = map.get(charArray[i + 1]);
+
+                if (current >= next) {
+                    result += current;
+                } else {
+                    result -= current;
                 }
+            } else {
+                result += current;
             }
         }
 
 
@@ -30,6 +30,6 @@ public void rotate(int[] nums, int k) {
             int temp = nums[i];
             nums[i] = nums[len + k - i - 1];
             nums[len + k - i - 1] = temp;
-        }ByteBuffer
+        }
     }
 }
Original file line number	Diff line number	Diff line change
`@@ -30,6 +30,6 @@ public void rotate(int[] nums, int k) {`
`30`	`30`	`int temp = nums[i];`
`31`	`31`	`nums[i] = nums[len + k - i - 1];`
`32`	`32`	`nums[len + k - i - 1] = temp;`
`33`		`- }ByteBuffer`
	`33`	`+ }`
`34`	`34`	`}`
`35`	`35`	`}`