Longest Palindromic Substring
[Question] 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.Leetc
原创
2016-09-17 08:35:02 ·
154 阅读 ·
0 评论