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.
chenyufeng1991 / 5.-longest-palindromic-substring Goto Github PK
View Code? Open in Web Editor NEWGiven 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.