Palindrome Partitioning

最新推荐文章于 2024-10-18 10:39:20 发布

joannae_hu

最新推荐文章于 2024-10-18 10:39:20 发布

阅读量232

点赞数

分类专栏： LeetCode 文章标签： leetcode palindrome partition

本文链接：https://blog.csdn.net/joannae_hu/article/details/38117303

版权

LeetCode 专栏收录该内容

157 篇文章 0 订阅

订阅专栏

-----QUESTION-----

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"]
  ]

-----SOLUTION-----

class Solution {
public:
    vector<vector<string>> partition(string s) {
        results.clear();
        int sLength = s.length();
        
        vector<vector<bool>> flag(sLength, vector<bool>(sLength,false));
    
        for (int i=0;i<sLength;i++)
        {
            for(int j=0;j<=i;j++)
                if(s[i]==s[j]&&(i-j<2||flag[j+1][i-1]))
                {
                    flag[j][i]=true;
                }
        }
        vector<string> pre;
        dfs(s,flag,pre,0);
        return results;
    }
    void dfs(const string &s, vector<vector<bool>> &flag, vector<string> &pre, int depth)
    {
        if(depth>=s.length()) 
        {
            results.push_back(pre);
            return;
        }
        
        for(int i = depth; i<s.length(); i++)
        {
            if(flag[depth][i])
            {
                pre.push_back(s.substr(depth, i-depth+1));
                dfs(s,flag,pre,i+1);
                pre.pop_back();
            }
        }
    }
private:
    vector<vector<string>> results;
};