Palindrome Partitioning Leetcode Python

hyperbolechi

于 2015-01-19 19:03:28 发布

阅读量514

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode python string Array

本文链接：https://blog.csdn.net/hyperbolechi/article/details/42877267

leetcode 专栏收录该内容

166 篇文章

订阅专栏

本文详细介绍了回文分割算法的基本概念、实现方法及优化策略，并通过实例演示了如何解决回文分割问题，旨在提高算法效率并提供更优解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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