solve problem Integer To Roman

Author: P-ppc

README.md

@@ -26,6 +26,7 @@ All solutions will be accepted!
 |371|[Sum Of Two Integers](https://leetcode-cn.com/problems/sum-of-two-integers/description/)|[java/py/js](./algorithms/SumOfTwoIntegers)|Easy|
 |171|[Excel Sheet Column Number](https://leetcode-cn.com/problems/excel-sheet-column-number/description/)|[java/py/js](./algorithms/ExcelSheetColumnNumber)|Easy|
 |168|[Excel Sheet Column Title](https://leetcode-cn.com/problems/excel-sheet-column-title/description/)|[java/py/js](./algorithms/ExcelSheetColumnTitle)|Easy|
+|12|[Integer To Roman](https://leetcode-cn.com/problems/integer-to-roman/description/)|[java/py/js](./algorithms/IntegerToRoman)|Easy|
 |13|[Roman To Integer](https://leetcode-cn.com/problems/roman-to-integer/description/)|[java/py/js](./algorithms/RomanToInteger)|Easy|
 |155|[Min Stack](https://leetcode-cn.com/problems/min-stack/description/)|[java/py/js](./algorithms/MinStack)|Easy|
 |232|[Implement Queue Using Stacks](https://leetcode-cn.com/problems/implement-queue-using-stacks/description/)|[java/py/js](./algorithms/ImplementQueueUsingStacks)|Easy|

algorithms/IntegerToRoman/README.md

@@ -0,0 +1,2 @@
+# Integer To Roman
+This problem is easy to solve

algorithms/IntegerToRoman/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public String intToRoman(int num) {
+        int[] values = new int[]{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+        String[] keys = new String[]{"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
+        StringBuilder res = new StringBuilder();
+        
+        for (int i = 0; i < values.length; i++) {
+            int value = values[i];
+            int temp = num / value;
+            num %= value;
+            while (temp-- > 0) {
+                res.append(keys[i]);
+            }
+        }
+        
+        return res.toString();
+    }
+}

algorithms/IntegerToRoman/solution.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number} num
+ * @return {string}
+ */
+var intToRoman = function(num) {
+    let values = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1],
+        keys = ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'],
+        res = ''
+    
+    values.forEach((value, i) => {
+        let temp = parseInt(num / value)
+        num %= value
+        while (temp-- > 0) {
+            res += keys[i]
+        }
+    })
+    
+    return res
+};

algorithms/IntegerToRoman/solution.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def intToRoman(self, num):
+        """
+        :type num: int
+        :rtype: str
+        """
+        res = ''
+        values = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]
+        keys = ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I']
+        
+        for i in range(len(values)):
+            value = values[i]
+            temp = num / value
+            num %= value
+            res += temp * keys[i]
+            
+        return res