feat: add solution of Roman to Integer(013) with javascript

Author: taryn2016

README.md

@@ -27,7 +27,7 @@
 | [001][001-question] | [Two Sum][001-tips]                                          | [✅][001-java] | [✅][001-js] | [✅][001-kotlin] |
 | [007][007-question] | [Reverse Integer][007-tips]                                  | [✅][007-java] | [✅][007-js] | [✅][007-kotlin] |
 | [009][009-question] | [Palindrome Number][009-tips]                                | [✅][009-java] | [✅][009-js] | [✅][009-kotlin] |
-| [013][013-question] | [Roman to Integer][013-tips]                                 | [✅][013-java] |              | [✅][013-kotlin] |
+| [013][013-question] | [Roman to Integer][013-tips]                                 | [✅][013-java] | [✅][013-js] | [✅][013-kotlin] |
 | [014][014-question] | [Longest Common Prefix][014-tips]                            | [✅][014-java] |              | [✅][014-kotlin] |
 | [020][020-question] | [Valid Parentheses][020-tips]                                | [✅][020-java] |              |                  |
 | [021][021-question] | [Merge Two Sorted Lists][021-tips]                           | [✅][021-java] |              |                  |
@@ -345,6 +345,7 @@
 [001-js]: ./src/_001/Solution.js
 [007-js]: ./src/_007/Solution.js
 [009-js]: ./src/_009/Solution.js
+[013-js]: ./src/_013/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_013/Solution.js

@@ -0,0 +1,28 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var romanToInt = function(s) {
+    let arr = s.split('')
+    var obj = {
+        I: 1,
+        V: 5,
+        X: 10,
+        L: 50,
+        C: 100,
+        D: 500,
+        M: 1000
+    }
+    var sum = 0
+    for (let i = arr.length - 1; i > 0 ; i--) {
+		console.log(arr[i])
+		console.log(arr[i - 1])
+        if (obj[arr[i]] > obj[arr[i - 1]]) {
+            sum = sum - obj[arr[i - 1]]
+        } else {
+            sum = sum + obj[arr[i - 1]]
+        }
+    }
+    return sum + obj[arr[arr.length - 1]]
+};
+romanToInt('DCXXI')

tips/013/README.md

@@ -73,7 +73,37 @@ class Solution {
     }
 }
 ```
-
+javascript:
+```javascript
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var romanToInt = function(s) {
+    let arr = s.split('')
+    var obj = {
+        I: 1,
+        V: 5,
+        X: 10,
+        L: 50,
+        C: 100,
+        D: 500,
+        M: 1000
+    }
+    var sum = 0
+    for (let i = arr.length - 1; i > 0 ; i--) {
+		console.log(arr[i])
+		console.log(arr[i - 1])
+        if (obj[arr[i]] > obj[arr[i - 1]]) {
+            sum = sum - obj[arr[i - 1]]
+        } else {
+            sum = sum + obj[arr[i - 1]]
+        }
+    }
+    return sum + obj[arr[arr.length - 1]]
+};
+romanToInt('DCXXI')
+```
 
 ## 结语
 
@@ -83,4 +113,4 @@ class Solution {
 
 [title]: https://leetcode.com/problems/roman-to-integer
 [ls]: https://github.com/SDE603/LeetCode-Solution
-[img]: ./013.gif
+[img]: ./013.gif