【LeetCode】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.

For example, given s = "aab",
Return

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

【回溯】

public class Solution {public ArrayList<ArrayList<String>> partition(String s) {ArrayList<ArrayList<String>> result = new ArrayList<ArrayList<String>>();ArrayList<String> list = new ArrayList<String>();if (s == null || s.length() == 0)return result;calResult(result,list,s);return result;}/*** 推断一个字符串是否是回文字符串*/private boolean isPalindrome(String str){int i = 0;int j = str.length() - 1;while (i < j){if (str.charAt(i) != str.charAt(j)){return false;}i++;j--;}return true;}/*** 回溯* @param result : 终于要的结果集 ArrayList<ArrayList<String>>* @param list : 当前已经增加的集合 ArrayList<String>* @param str : 当前要处理的字符串*/private void calResult(ArrayList<ArrayList<String>> result, ArrayList<String> list, String str){//当处理到传入的字符串长度等于0,则这个集合list满足条件，增加到结果集中if (str.length() == 0)result.add(new ArrayList<String>(list));int len = str.length();//递归调用//字符串由前往后，先推断str.substring(0, i)是否是回文字符串//假设是的话，继续调用函数calResult，把str.substring(i)字符串传入做处理for (int i=1; i<=len; ++i){String subStr = str.substring(0, i);if (isPalindrome(subStr)){list.add(subStr);String restSubStr = str.substring(i);calResult(result,list,restSubStr);list.remove(list.size()-1);}}}
}

转载于:https://www.cnblogs.com/blfbuaa/p/6913823.html

【LeetCode】Palindrome Partitioning 解题报告相关推荐

LeetCode Palindrome Partitioning II
原题链接在这里:https://leetcode.com/problems/palindrome-partitioning-ii/ 题目: Given a string s, partition s ...
LeetCode Palindrome Partitioning(dfs +回文串 )
问题:给出一个字符串,输出回文串,使得拼接后为原来的字符串思路:先通过动态规划得到所有的回文串,然后使用深度优先搜索得到所有的解具体代码参考: https://github.com/wuli249 ...
LeetCode | Palindrome Partitioning I,II
Given a string s, partition s such that every substring of the partition is a palindrome. Return all ...
[LeetCode] Multiply Strings 解题报告
Given two numbers represented as strings, return multiplication of the numbers as a string. Note: Th ...
LeetCode: Sort List 解题报告
Sort List Sort a linked list in O(n log n) time using constant space complexity. 使用Merge Sort, 空间复杂度 ...
Leetcode Weekly 188 解题报告
文章目录 Leetcode 1441. 用栈操作构建数组 Leetcode 1442. 形成两个异或相等数组的三元组数目 Leetcode 1443. 收集树上所有苹果的最少时间 Leetcode 1 ...
[LeetCode]Palindrome Partitioning 找出所有可能的组合回文
给定一个字符串,切割字符串,这样每个子字符串是一个回文字符串. 要找出所有可能的组合. 办法:暴力搜索+回溯 class Solution { public:int *b,n;vector<ve ...
[LeetCode]Distinct Subsequences,解题报告
题目 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequen ...
LeetCode: Maximum Subarray 解题报告
Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which ...

【LeetCode】Palindrome Partitioning 解题报告

【LeetCode】Palindrome Partitioning 解题报告相关推荐

最新文章

热门文章