【重来】【vip】5. Longest Palindromic Substring【m】【30】【97】
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.
Subscribe to s
原创
2016-04-13 13:12:14 ·
1263 阅读 ·
0 评论