leetcode-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, and there exists one unique longest palindromic substring.spa 思路:所遍歷字符爲一個迴文子串的中間字符,則
相關文章
相關標籤/搜索