add js solution for leetcode11

Author: swiftwind0405

README.md

@@ -401,7 +401,7 @@ LeetCode
 |14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [js](./algorithms/longestCommonPrefix/longestCommonPrefix.js) |Easy|
 |13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| |Easy|
 |12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| |Medium|
-|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| |Medium|
+|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [js](./algorithms/containerWithMostWater/containerWithMostWater.js) |Medium|
 |10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)| |Hard|
 |9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| |Easy|
 |8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| |Easy|

algorithms/containerWithMostWater/containerWithMostWater.js

@@ -0,0 +1,13 @@
+/**
+ * @param {number[]} height
+ * @return {number}
+ */
+var maxArea = function(height) {
+    let ans = 0, L = 0, R = height.length - 1;
+    while(L <= R) {
+        const now = Math.min(height[L], height[R]) * (R - L);
+        ans = Math.max(ans, now);
+        height[L] > height[R] ? R-- : L++ ;
+    }
+    return ans;
+};