摘要：
最长回文子串动态规划的方法的参考Palindrome Partitioning （回文子串题）代码：class Solution {public: string longestPalindrome(string s) { int n=s.size(); int dp... 阅读全文
摘要：
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文