leetcode5. Longest Palindromic Substring

1. Longest Palindromic Substring
   DescriptionHintsSubmissionsDiscussSolution

DiscussPick One

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”

这道题当时写在我的博客园上面了，直接复制过来博客园和csdn的样式不兼容，看我的原篇就好：http://www.cnblogs.com/zhangmingzhao/p/7327248.html