feat: update leetcode solutions: No.0012. Integer to Roman

Author: yanglbme

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

@@ -60,22 +60,45 @@ M             1000</pre>
 
 <!-- 这里可写通用的实现逻辑 -->
 
+贪心算法实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def intToRoman(self, num: int) -> str:
+        nums = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')]
+        res = []
+        for k, v in nums:
+            while num >= k:
+                num -= k
+                res.append(v)
+        return ''.join(res)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String intToRoman(int num) {
+        int[] nums = new int[]{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+        String[] romans = new String[]{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < nums.length; ++i) {
+            while (num >= nums[i]) {
+                num -= nums[i];
+                sb.append(romans[i]);
+            }
+        }
+        return sb.toString();
+    }
+}
 ```
 
 ### **...**

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

@@ -89,13 +89,34 @@ M             1000</pre>
 ### **Python3**
 
 ```python
-
+class Solution:
+    def intToRoman(self, num: int) -> str:
+        nums = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')]
+        res = []
+        for k, v in nums:
+            while num >= k:
+                num -= k
+                res.append(v)
+        return ''.join(res)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String intToRoman(int num) {
+        int[] nums = new int[]{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+        String[] romans = new String[]{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < nums.length; ++i) {
+            while (num >= nums[i]) {
+                num -= nums[i];
+                sb.append(romans[i]);
+            }
+        }
+        return sb.toString();
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0012.Integer to Roman/Solution.java

@@ -1,10 +1,14 @@
 class Solution {
-    private final String[] M = {"", "M", "MM", "MMM"};
-    private final String[] C = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
-    private final String[] X = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
-    private final String[] I = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
     public String intToRoman(int num) {
-        return M[num / 1000] + C[(num % 1000) / 100] + X[(num % 100) / 10] + I[num % 10];
+        int[] nums = new int[]{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+        String[] romans = new String[]{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < nums.length; ++i) {
+            while (num >= nums[i]) {
+                num -= nums[i];
+                sb.append(romans[i]);
+            }
+        }
+        return sb.toString();
     }
-}
-
+}

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

@@ -0,0 +1,9 @@
+class Solution:
+    def intToRoman(self, num: int) -> str:
+        nums = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')]
+        res = []
+        for k, v in nums:
+            while num >= k:
+                num -= k
+                res.append(v)
+        return ''.join(res)