摘要： Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs.For example, givens="aab",Return1since the palindrome partitioning["aa","b"]could be produced using 1 cut.[解题思路]记录所有合法的 阅读全文

摘要： Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, givens="aab",Return [ ["aa","b"], ["a","a","b"] ]列出字符串分解的题基本都是DFS，本题是找出s所有合数的分解，故i=start在perm 阅读全文

摘要： TODO。。。。 阅读全文