😄update my solutions

Author: xingbofeng

README.md

@@ -1,8 +1,8 @@
 <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)-16/573(107)-green.svg?style=flat-square" alt="">
+    <img src="https://img.shields.io/badge/Solved/Total(Locked)-17/573(107)-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-7-blue.svg?style=flat-square" alt="">
+    <img src="https://img.shields.io/badge/Medium-8-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>
@@ -21,6 +21,7 @@
 |001|[two-sum](https://leetcode.com/problems/two-sum/)| [python](.&#x2F;solutions&#x2F;001.two-sum&#x2F;two-sum.py)|Easy|34.13%||
 |002|[add-two-numbers](https://leetcode.com/problems/add-two-numbers/)| [c](.&#x2F;solutions&#x2F;002.add-two-numbers&#x2F;add-two-numbers.c)|Medium|27.64%||
 |003|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [javascript](.&#x2F;solutions&#x2F;003.longest-substring-without-repeating-characters&#x2F;longest-substring-without-repeating-characters.js)|Medium|24.27%||
+|005|[longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring/)| [c++](.&#x2F;solutions&#x2F;005.longest-palindromic-substring&#x2F;longest-palindromic-substring.cpp)|Medium|25.17%||
 |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%||

solutions/005.longest-palindromic-substring/db.json

@@ -0,0 +1 @@
+{"c++":"class Solution {\npublic:\n  string longestPalindrome(string s) {\n    string longest = \"\";\n    for (int k = 0; k < s.size(); ++k) {\n      int i = k, j = k;\n      while(i >= 0 && j <= s.size() - 1) {\n        if (s[i] != s[j]) {\n          break;\n        } else {\n          i--;\n          j++;\n        }\n      }\n      // 还原一位\n      i++;\n      j--;\n      if (j - i + 1 > longest.size()) {\n        longest = s.substr(i, j - i + 1); \n      }\n      // 对于偶回文串的处理\n      i = k, j = k;\n      if (s[k] == s[k + 1]) {\n        j = k + 1;\n      }\n      while(i >= 0 && j <= s.size() - 1) {\n        if (s[i] != s[j]) {\n          break;\n        } else {\n          i--;\n          j++;\n        }\n      }\n      // 还原一位\n      i++;\n      j--;\n      if (j - i + 1 > longest.size()) {\n        longest = s.substr(i, j - i + 1); \n      }\n    }\n    return longest;\n  }\n};"}

solutions/005.longest-palindromic-substring/longest-palindromic-substring.cpp

@@ -0,0 +1,43 @@
+class Solution {
+public:
+  string longestPalindrome(string s) {
+    string longest = "";
+    for (int k = 0; k < s.size(); ++k) {
+      int i = k, j = k;
+      while(i >= 0 && j <= s.size() - 1) {
+        if (s[i] != s[j]) {
+          break;
+        } else {
+          i--;
+          j++;
+        }
+      }
+      // 还原一位
+      i++;
+      j--;
+      if (j - i + 1 > longest.size()) {
+        longest = s.substr(i, j - i + 1); 
+      }
+      // 对于偶回文串的处理
+      i = k, j = k;
+      if (s[k] == s[k + 1]) {
+        j = k + 1;
+      }
+      while(i >= 0 && j <= s.size() - 1) {
+        if (s[i] != s[j]) {
+          break;
+        } else {
+          i--;
+          j++;
+        }
+      }
+      // 还原一位
+      i++;
+      j--;
+      if (j - i + 1 > longest.size()) {
+        longest = s.substr(i, j - i + 1); 
+      }
+    }
+    return longest;
+  }
+};

solutions/005.longest-palindromic-substring/question.md

@@ -0,0 +1,18 @@
+Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
+
+Example:
+
+Input: "babad"
+
+Output: "bab"
+
+Note: "aba" is also a valid answer.
+
+
+
+Example:
+
+Input: "cbbd"
+
+Output: "bb"
+

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},"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-07-29","total":573,"solved":16,"locked":107}
+{"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},"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-07-29","total":573,"solved":17,"locked":107}