标签：io sp c on r bs as leetcode dp
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.
Solution 1: DP
[Leetcode] Longest Palindromic Substring
标签：io sp c on r bs as leetcode dp
原文地址：http://www.cnblogs.com/Phoebe815/p/4001898.html
