leetcode刷题笔记(Golang)--5. Longest Palindromic Substring

题链接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. Example 1: Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: Input: "cbbd" Output: "bb" 解题思路：基本就是无脑的”马拉车“算法（Manacher），其中的字符串处理部分用到了链接的现有函数 func longestPalindrome(s string) ...阅读全文