1218提交

Author: zzxboy1

README.md

@@ -10,6 +10,9 @@
 |5|[Longest Palindromic](https://leetcode.com/problems/longest-palindromic-substring/)| [JavaScript](./algorithms/Longest Palindromic.js)|Medium|
 |6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [JavaScript](./algorithms/ZigZag Conversion.js)|Easy|
 |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|
 |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

@@ -0,0 +1,27 @@
+/**
+ * @param {number[]} height
+ * @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;
+           }
+        }
+    return max;
+};

algorithms/Palindrome Number.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number} x
+ * @return {boolean}
+ */
+var isPalindrome = function(x) {
+    var xString=""+x;
+    if(StringReverse(xString)===xString){
+        return true;
+    }
+    else{
+        return false;
+    }
+};
+
+function StringReverse(s){
+    var result="";
+    for (var i=s.length-1;i>=0;i--){
+        result+=s[i];
+    }
+    return result;
+}

algorithms/String to Integer (atoi).js

@@ -0,0 +1,21 @@
+/**
+ * @param {string} str
+ * @return {number}
+ */
+var myAtoi = function(str) {
+    var result = parseInt(str);
+    if(str===""|| isNaN(result)){
+        return 0;
+    }
+    else if(result> Math.pow(2,31)-1)
+    {
+        return Math.pow(2,31)-1;
+    }
+    else if(result< -Math.pow(2,31))
+    {
+        return -Math.pow(2,31);
+    }
+    else{
+        return result;
+    }
+};