😄update my solutions

Author: xingbofeng

README.md

@@ -1,16 +1,16 @@
 <p align="center"><img width="300" src="https://raw.githubusercontent.com/Ma63d/leetcode-spider/master/img/site-logo.png"></p>
 <p align="center">
-    <img src="https://img.shields.io/badge/Solved/Total(Locked)-18/577(109)-green.svg?style=flat-square" alt="">
+    <img src="https://img.shields.io/badge/Solved/Total(Locked)-19/577(109)-green.svg?style=flat-square" alt="">
     <img src="https://img.shields.io/badge/Hard-0-blue.svg?style=flat-square" alt="">
-    <img src="https://img.shields.io/badge/Medium-9-blue.svg?style=flat-square" alt="">
+    <img src="https://img.shields.io/badge/Medium-10-blue.svg?style=flat-square" alt="">
     <img src="https://img.shields.io/badge/Easy-9-blue.svg?style=flat-square" alt="">
 </p>
 <h3 align="center">My leetcode solutions</h3>
 
 <p align="center">
     <b>Language: javascript python python3 c++ c</b>
     <br>
-    <b>Last updated: 2017-08-05</b>
+    <b>Last updated: 2017-08-06</b>
     <br><br>
 </p>
 <!--请保留下面这行信息，让更多用户了解到这个小爬虫，衷心感谢您的支持-->
@@ -26,6 +26,7 @@
 |007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)| [c](.&#x2F;solutions&#x2F;007.reverse-integer&#x2F;reverse-integer.c)|Easy|24.32%||
 |008|[string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi/)| [c++](.&#x2F;solutions&#x2F;008.string-to-integer-atoi&#x2F;string-to-integer-atoi.cpp)|Medium|13.96%||
 |009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)| [python](.&#x2F;solutions&#x2F;009.palindrome-number&#x2F;palindrome-number.py)|Easy|35.20%||
+|011|[container-with-most-water](https://leetcode.com/problems/container-with-most-water/)| [c++](.&#x2F;solutions&#x2F;011.container-with-most-water&#x2F;container-with-most-water.cpp)|Medium|36.54%||
 |013|[roman-to-integer](https://leetcode.com/problems/roman-to-integer/)| [python](.&#x2F;solutions&#x2F;013.roman-to-integer&#x2F;roman-to-integer.py)|Easy|45.52%||
 |014|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/)| [c++](.&#x2F;solutions&#x2F;014.longest-common-prefix&#x2F;longest-common-prefix.cpp)|Easy|31.44%||
 |015|[3sum](https://leetcode.com/problems/3sum/)| [c++](.&#x2F;solutions&#x2F;015.3sum&#x2F;3sum.cpp)|Medium|21.59%||

solutions/011.container-with-most-water/container-with-most-water.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+  int maxArea(vector<int>& height) {
+    int left = 0;
+    int right = height.size() - 1;
+    int result = 0;
+    while(left < right) {
+      bool checkheight = (height[left] < height[right]);
+      int minheight = checkheight ? height[left] : height[right];
+      int newarea = minheight * (right - left);
+      result = (result > newarea) ? result : newarea;
+      checkheight ? left++ : right--;
+    }
+    return result;
+  }
+};

solutions/011.container-with-most-water/db.json

@@ -0,0 +1 @@
+{"c++":"class Solution {\npublic:\n  int maxArea(vector<int>& height) {\n    int left = 0;\n    int right = height.size() - 1;\n    int result = 0;\n    while(left < right) {\n      bool checkheight = (height[left] < height[right]);\n      int minheight = checkheight ? height[left] : height[right];\n      int newarea = minheight * (right - left);\n      result = (result > newarea) ? result : newarea;\n      checkheight ? left++ : right--;\n    }\n    return result;\n  }\n};"}

solutions/011.container-with-most-water/question.md

@@ -0,0 +1,3 @@
+Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
+
+Note: You may not slant the container and n is at least 2.

solutions/result.json

@@ -1 +1 @@
-{"1":{"id":1,"level":1,"title":"two-sum","paidOnly":false,"acceptance":"34.13%","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","paidOnly":false,"acceptance":"27.64%","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","paidOnly":false,"acceptance":"24.27%","language":["javascript"],"generated":true},"5":{"id":5,"level":2,"title":"longest-palindromic-substring","paidOnly":false,"acceptance":"25.17%","language":["c++"],"generated":true},"6":{"id":6,"level":2,"title":"zigzag-conversion","paidOnly":false,"acceptance":"26.73%","language":["c++"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","paidOnly":false,"acceptance":"24.32%","language":["c"],"generated":true},"8":{"id":8,"level":2,"title":"string-to-integer-atoi","paidOnly":false,"acceptance":"13.96%","language":["c++"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","paidOnly":false,"acceptance":"35.20%","language":["python"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","paidOnly":false,"acceptance":"45.52%","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","paidOnly":false,"acceptance":"31.44%","language":["c++"],"generated":true},"15":{"id":15,"level":2,"title":"3sum","paidOnly":false,"acceptance":"21.59%","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","paidOnly":false,"acceptance":"33.34%","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","paidOnly":false,"acceptance":"35.50%","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","paidOnly":false,"acceptance":"38.84%","language":["c++"],"generated":true},"28":{"id":28,"level":1,"title":"implement-strstr","paidOnly":false,"acceptance":"27.97%","language":["c++"],"generated":true},"35":{"id":35,"level":1,"title":"search-insert-position","paidOnly":false,"acceptance":"39.66%","language":["c"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","paidOnly":false,"acceptance":"29.89%","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","paidOnly":false,"acceptance":"24.34%","language":["c"],"generated":true},"lastUpdatedTime":"2017-08-05","total":577,"solved":18,"locked":109}
+{"1":{"id":1,"level":1,"title":"two-sum","paidOnly":false,"acceptance":"34.13%","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","paidOnly":false,"acceptance":"27.64%","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","paidOnly":false,"acceptance":"24.27%","language":["javascript"],"generated":true},"5":{"id":5,"level":2,"title":"longest-palindromic-substring","paidOnly":false,"acceptance":"25.17%","language":["c++"],"generated":true},"6":{"id":6,"level":2,"title":"zigzag-conversion","paidOnly":false,"acceptance":"26.73%","language":["c++"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","paidOnly":false,"acceptance":"24.32%","language":["c"],"generated":true},"8":{"id":8,"level":2,"title":"string-to-integer-atoi","paidOnly":false,"acceptance":"13.96%","language":["c++"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","paidOnly":false,"acceptance":"35.20%","language":["python"],"generated":true},"11":{"id":11,"level":2,"title":"container-with-most-water","paidOnly":false,"acceptance":"36.54%","language":["c++"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","paidOnly":false,"acceptance":"45.52%","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","paidOnly":false,"acceptance":"31.44%","language":["c++"],"generated":true},"15":{"id":15,"level":2,"title":"3sum","paidOnly":false,"acceptance":"21.59%","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","paidOnly":false,"acceptance":"33.34%","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","paidOnly":false,"acceptance":"35.50%","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","paidOnly":false,"acceptance":"38.84%","language":["c++"],"generated":true},"28":{"id":28,"level":1,"title":"implement-strstr","paidOnly":false,"acceptance":"27.97%","language":["c++"],"generated":true},"35":{"id":35,"level":1,"title":"search-insert-position","paidOnly":false,"acceptance":"39.66%","language":["c"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","paidOnly":false,"acceptance":"29.89%","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","paidOnly":false,"acceptance":"24.34%","language":["c"],"generated":true},"lastUpdatedTime":"2017-08-06","total":577,"solved":19,"locked":109}