Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
给定一个字符串 s,找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。
Example 1:
1 2 3 4 5 6 7
Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: