5. Longest Palindromic Substring

标签：str   lock   nbsp   block   length   lin   long   note   mic   

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"

5. Longest Palindromic Substring

标签：str   lock   nbsp   block   length   lin   long   note   mic   

原文地址：http://www.cnblogs.com/naivecoder/p/7039646.html