1219

Author: zzxboy1

README.md

@@ -12,7 +12,9 @@
 |7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [JavaScript](./algorithms/Reverse Integer.js)|Easy|
 |8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [JavaScript](./algorithms/String to Integer (atoi).js)|Easy|
 |9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [JavaScript](./algorithms/Palindrome Number.js)|Easy|
-|10|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [JavaScript](./algorithms/Container With Most Water.js)|Medium|
+|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [JavaScript](./algorithms/Container With Most Water.js)|Medium|
+|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [JavaScript](./algorithms/Integer to Roman.js)|Medium|
+|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [JavaScript](./algorithms/Roman to Integer.js)|Easy|
 |371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [JavaScript](./algorithms/Sum of Two Integers.js)|Easy|
 |372|[Super Pow](https://leetcode.com/problems/super-pow/)| [JavaScript](./algorithms/SuperPow.js)|Medium|
 

algorithms/Container With Most Water.js

@@ -3,25 +3,24 @@
  * @return {number}
  */
 var maxArea = function(height) {
-    var max=0,
-        temp=0,
-        h=0,
-        l=0,
-        start=0,
-        end=height.length-1;
-    for(var i=0;i<height.length-1;i++){
-           l=end-start;
-           if(height[start]>height[end]){
-               h=height[end];
-               end--;
-           }
-           else{
-               h=height[start];
-               start++;
-           }
-           if (max<h*l){
-               max=h*l;
-           }
+    var max = 0,
+        temp = 0,
+        h = 0,
+        l = 0,
+        start = 0,
+        end = height.length - 1;
+    for (var i = 0; i < height.length - 1; i++) {
+        l = end - start;
+        if (height[start] > height[end]) {
+            h = height[end];
+            end--;
+        } else {
+            h = height[start];
+            start++;
         }
+        if (max < h * l) {
+            max = h * l;
+        }
+    }
     return max;
-};
+};

algorithms/Integer to Roman.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number} num
+ * @return {string}
+ */
+var intToRoman = function(num) {
+    var huns = ["", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"],
+    tens = ["", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"],
+    ones = ["", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"],
+    thNum=Math.floor(num/1000),
+    hNum=Math.floor(num%1000/100),
+    tNum=Math.floor(num%100/10),
+    oNum=num%10,
+    result="";
+    while(thNum>0){
+        result+="M";
+        thNum--;
+    }
+    result=result+huns[hNum]+tens[tNum]+ones[oNum];
+    return result;
+};

algorithms/Roman to Integer.js

@@ -0,0 +1,29 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var romanToInt = function(s) {
+    var huns = ["C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"],
+    tens = ["X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"],
+    ones = ["I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"],
+    result=0,hNum=0,tNum=0,oNum=0,count=0,Num=[0,0,0],
+    sSub=s,
+    Arr=[ones,tens,huns];
+    while(sSub[0]==="M"){
+        sSub=sSub.substring(1);
+    }
+    var thNum=s.length-sSub.length;
+    for(var j=0;j<3;j++){
+        for(var i=0;i<9;i++){
+            if(sSub.indexOf(Arr[j][i])!==-1){
+                Num[j]=i+1;
+                if(Num[j]==4){
+                    break;
+                }
+            }
+        }
+        sSub=sSub.replace(Arr[j][Num[j]-1],"");
+    }
+    result=thNum*1000+Num[2]*100+Num[1]*10+Num[0];
+    return result;
+};