摘要： 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. 给定一个字符串，返回最小 阅读全文

摘要： 最近要开始准备找工作了，开始做Leetcode 上面的面试题，暂定每天至少一道。下面是第一道题：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" 阅读全文