← 返回 bytedance 的题目列表Longest Palindromic Substring
类型：online_judge
Longest Palindromic Substring
Given a string s, return the longest palindromic substring in s.
Input
One line: a string s.
Output
Print one string: the longest palindromic substring.
If multiple answers have the same maximum length, print any one.
Constraints
1 <= len(s) <= 2000
Example
Input: babad Output: bab
A palindrome reads the same forwards and backwards.
Example
Input
babad
Output
bab