LeetCode 5. Longest Palindromic Substring

Descripition：

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:

Input: “babad”
Output: “bab”
Note: “aba” is also a valid answer.

Example 2:

Input: “cbbd”
Output: “bb”

---

这道题官方有解答，我感觉已经很全面了。
官方解答：5. Longest Palindromic Substring
官方解答翻译版：字符串系列6 最长回文子串