LeetCode131：分割回文串

最新推荐文章于 2021-07-15 07:57:58 发布

独L无二

最新推荐文章于 2021-07-15 07:57:58 发布

阅读量215

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_31275315/article/details/106994260

版权

LeetCode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/palindrome-partitioning/

问题描述

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

Return all possible palindrome partitioning of s.

Example:

Input: "aab"
Output:
[
  ["aa","b"],
  ["a","a","b"]
]

解题思路

深度优先搜索+回溯

https://leetcode-cn.com/problems/palindrome-partitioning/solution/hui-su-you-hua-jia-liao-dong-tai-gui-hua-by-liweiw/

Solution

class Solution {
public:
    vector<vector<string>> partition(string s) {
        vector<vector<string>> res;
        vector<string> cur;
        dfs(s,cur,res);
        return res;
    }
 
    bool isPalindrome(string s){
        if(s.empty()) 
            return false;
        int left = 0; 
        int right = s.length() - 1;
        while(left <= right)
        {
            if(s[left] != s[right])
                return false;
            left++;
            right--;
        }
        return true;
    }
 
    void dfs(string s,vector<string> &cur,vector<vector<string>> &res){
        if (s==""){
            res.push_back(cur);
            return;
        }
 
        for (int i = 1; i <= s.length(); ++i) {
            string sub=s.substr(0,i);
            if (isPalindrome(sub)){
                cur.push_back(sub);
                dfs(s.substr(i,s.length()-i),cur,res);
                cur.pop_back();
            }
        }
 
    }
 
};