Palindrome Partitioning 題解

原創文章，拒絕轉載

題目來源：https://leetcode.com/problems/palindrome-partitioning/description/

---

Description

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) {int len = s.length();vector<vector<string>> res;vector<string> path;dfs(0, s, path, res);return res;}void dfs(int idx, string& str, vector<string>& path, vector<vector<string>>& res) {if (idx == str.length()) {res.push_back(path);return;}for (int i = idx; i < str.size(); i++) {if (isPalindrome(str, idx, i)) {path.push_back(str.substr(idx, i - idx + 1));dfs(i + 1, str, path, res);/* pop back every time in recurse stack,* than all the paces added in dfs can be remove */path.pop_back();}}}bool isPalindrome(string& str, int start, int end) {while (start < end) {if (str[start] != str[end]) {return false;}start++;end--;}return true;} };

---

解題描述

這道題是目的是找到一個字符串中所有由回文子串組成的集合，算法是對給出的字符串進行遍歷，查找所有回文子串，對每個回文子串再進行DFS查找新的回文子串，這樣就能找到所有由回文子串切分的子串的集合。

轉載于:https://www.cnblogs.com/yanhewu/p/7932374.html

總結

以上是生活随笔為你收集整理的[Leetcode Week13]Palindrome Partitioning的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。