5. Longest Palindromic Substring 题面 Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. 找出给定数组中,最长的回文子串.最长输入尾1000. 样例 Example 1: Input: "babad" Output: "bab" Note: "a
要形成包含多个行的字符串,可以串联两个字符串. 为此,请键入正斜杠,然后按 return 键. 反斜杠导致编译器忽略以下换行符. 例如,字符串 "Long strings can be bro\ ken into two or more pieces." 与字符串是相同的. "Long strings can be broken into two or more pieces." 可以使用字符串串联的任何地方可能以前已使用后跟换行符的反斜杠长输入字符