Palindrome Partitioning Leetcode Python

Given a string s, partition s such that every substring of the partition is a palindrome.


Return all possible palindrome partitioning of s.


For example, given s = "aab",
Return


  [
    ["aa","b"],
    ["a","a","b"]

  ]

这道题目的解法与之前的求sub array的解法一直，逐层递归求出 sub 并且满足 palindrome.但是解法的complexity维度比较大，所以求解时候比较耗时。

还在想更好的解决方法。如果知道的欢迎留言啊。

This problem is an np hard problem, we need to traverse and find sub in every level and combine the answer. It is an NP hard problem. I am still looking for better solution.

class Solution:
    # @param s, a string
    # @return a list of lists of string
    def pali(self,s):
        if len(s)==0:
            return True
        for index in range(len(s)):
            if s[index]!=s[len(s)-index-1]:
                return False
        return True
    def dfs(self,valuelist,s,solution):
        if len(s)==0:
            solution.append(valuelist)
        for index in range(1,len(s)+1):
            if self.pali(s[:index]):
                self.dfs(valuelist+[s[:index]],s[index:],solution)
    def partition(self, s):
        solution=[]
        self.dfs([],s,solution)
        return solution