feat: update solutions to lc problem: No.0013

No.0013.Roman to Integer

Author: poltao

solution/0000-0099/0013.Roman to Integer/README.md

@@ -80,6 +80,10 @@ M             1000</pre>
 
 ## 解法
 
+**方法一：模拟**
+
+因为字符串的长度 $1 \leq s.length \leq 15$，故时间复杂度为 $O(1)$，空间复杂度为 $O(1)$。
+
 <!-- 这里可写通用的实现逻辑 -->
 
 <!-- tabs:start -->
@@ -91,30 +95,15 @@ M             1000</pre>
 ```python
 class Solution:
     def romanToInt(self, s: str) -> int:
-        nums = {
-            'M': 1000,
-            'CM': 900,
-            'D': 500,
-            'CD': 400,
-            'C': 100,
-            'XC': 90,
-            'L': 50,
-            'XL': 40,
-            'X': 10,
-            'IX': 9,
-            'V': 5,
-            'IV': 4,
-            'I': 1,
-        }
-        i = res = 0
-        while i < len(s):
-            if i + 1 < len(s) and s[i : i + 2] in nums:
-                res += nums[s[i : i + 2]]
-                i += 2
+        romans = {'I': 1, 'V': 5, 'X': 10,
+                  'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+        ans = 0
+        for i in range(len(s)-1):
+            if romans[s[i]] < romans[s[i+1]]:
+                ans -= romans[s[i]]
             else:
-                res += nums[s[i : i + 1]]
-                i += 1
-        return res
+                ans += romans[s[i]]
+        return ans+romans[s[-1]]
 ```
 
 ### **Java**
@@ -180,6 +169,23 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func romanToInt(s string) int {
+    romans := map[byte]int{'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+    ans := 0
+    for i := 0; i < len(s)-1; i++ {
+        if romans[s[i]] < romans[s[i+1]] {
+            ans -= romans[s[i]]
+        } else {
+            ans += romans[s[i]]
+        }
+    }
+    return ans + romans[s[len(s)-1]]
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0013.Roman to Integer/README_EN.md

@@ -64,37 +64,26 @@ M             1000</pre>
 
 ## Solutions
 
+**Approach 1: Simulation**
+
+Time complexity $O(1)$, Space complexity $O(1)$.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
 class Solution:
     def romanToInt(self, s: str) -> int:
-        nums = {
-            'M': 1000,
-            'CM': 900,
-            'D': 500,
-            'CD': 400,
-            'C': 100,
-            'XC': 90,
-            'L': 50,
-            'XL': 40,
-            'X': 10,
-            'IX': 9,
-            'V': 5,
-            'IV': 4,
-            'I': 1,
-        }
-        i = res = 0
-        while i < len(s):
-            if i + 1 < len(s) and s[i : i + 2] in nums:
-                res += nums[s[i : i + 2]]
-                i += 2
+        romans = {'I': 1, 'V': 5, 'X': 10,
+                  'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+        ans = 0
+        for i in range(len(s)-1):
+            if romans[s[i]] < romans[s[i+1]]:
+                ans -= romans[s[i]]
             else:
-                res += nums[s[i : i + 1]]
-                i += 1
-        return res
+                ans += romans[s[i]]
+        return ans+romans[s[-1]]
 ```
 
 ### **Java**
@@ -158,6 +147,23 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func romanToInt(s string) int {
+    romans := map[byte]int{'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+    ans := 0
+    for i := 0; i < len(s)-1; i++ {
+        if romans[s[i]] < romans[s[i+1]] {
+            ans -= romans[s[i]]
+        } else {
+            ans += romans[s[i]]
+        }
+    }
+    return ans + romans[s[len(s)-1]]
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0013.Roman to Integer/Solution.go

@@ -1,41 +1,12 @@
-// 字符          数值
-// I             1
-// V             5
-// X             10
-// L             50
-// C             100
-// D             500
-// M             1000
-var table = make(map[string]int)
-
-func init() {
-	table["I"] = 1
-	table["IV"] = 4
-	table["V"] = 5
-	table["IX"] = 9
-	table["X"] = 10
-	table["XL"] = 40
-	table["L"] = 50
-	table["XC"] = 90
-	table["C"] = 100
-	table["CD"] = 400
-	table["D"] = 500
-	table["CM"] = 900
-	table["M"] = 1000
-}
-
 func romanToInt(s string) int {
-	var result int
-	lenS := len(s)
-	for i:=0; i<lenS; i++ {
-		if i < lenS - 1 {
-			if v, exist := table[s[i:i+2]]; exist {
-				result += v
-				i++
-				continue
-			}
-		}
-        result += table[string(s[i])]
-	}
-	return result
+    romans := map[byte]int{'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+    ans := 0
+    for i := 0; i < len(s)-1; i++ {
+        if romans[s[i]] < romans[s[i+1]] {
+            ans -= romans[s[i]]
+        } else {
+            ans += romans[s[i]]
+        }
+    }
+    return ans + romans[s[len(s)-1]]
 }

solution/0000-0099/0013.Roman to Integer/Solution.py

@@ -1,26 +1,11 @@
 class Solution:
     def romanToInt(self, s: str) -> int:
-        nums = {
-            'M': 1000,
-            'CM': 900,
-            'D': 500,
-            'CD': 400,
-            'C': 100,
-            'XC': 90,
-            'L': 50,
-            'XL': 40,
-            'X': 10,
-            'IX': 9,
-            'V': 5,
-            'IV': 4,
-            'I': 1,
-        }
-        i = res = 0
-        while i < len(s):
-            if i + 1 < len(s) and s[i : i + 2] in nums:
-                res += nums[s[i : i + 2]]
-                i += 2
+        romans = {'I': 1, 'V': 5, 'X': 10,
+                  'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+        ans = 0
+        for i in range(len(s)-1):
+            if romans[s[i]] < romans[s[i+1]]:
+                ans -= romans[s[i]]
             else:
-                res += nums[s[i : i + 1]]
-                i += 1
-        return res
+                ans += romans[s[i]]
+        return ans+romans[s[-1]]