[leet code] Palindrome Partitioning
来源:互联网 发布:电大挂科软件 编辑:程序博客网 时间:2024/06/06 11:45
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"] ]
====================
Analysis:
It's a "Sub-set" problem. Therefore, the idea of ours is how to relate it to the solution of "sub-set problem" (DFS).
Frame of solution for "Sub-set" problem (DFS):
main method{
create result set;
call recursive function;
return result set;
}
recursive function(given String, index, result set, single result) {
if (reached the length of the single result) add single result to result set;
else{
iteration (try all the probabilities for the 1st element){
choose the first element;
pass the remaining values/sets/substring into recursive call;
remove the chosen element and try next probability;
}
}
}
Accordingly, for our problem this time, we should
1. Base on this basic frame and add the isPalindrome check.
2. "reached the length of the single result" need to be checked by index. (coz we could not directly get the length of the single result, its ArrayList<String>)
3. in iteration block, we are not trying "a", "b", "c", "d" (i.e. same element length but different possible value), but trying "a", "ab", "abc", "abcd" (i.e. different element length but all include value "a").
Having the understanding above, we can implement our idea as below:
public class Solution { public ArrayList<ArrayList<String>> partition(String s) { ArrayList<ArrayList<String>> rs = new ArrayList<ArrayList<String>>(); helper(s, rs, 0, new ArrayList<String>()); return rs; } public void helper(String s, ArrayList<ArrayList<String>> rs, int index, ArrayList<String> singleRs){ if(index == s.length()) rs.add(new ArrayList<String>(singleRs)); else{ for(int i=index; i<s.length(); i++){ if(isPalindrome(s, index, i)){ // key point of this problem singleRs.add(s.substring(index, i+1)); helper(s, rs, i+1, singleRs); singleRs.remove(singleRs.size()-1); } } } } public boolean isPalindrome(String s, int start, int end){ while(start<=end){ if(s.charAt(start) != s.charAt(end)) return false; start++; end--; } return true; }}
- [leet code] Palindrome Partitioning
- [leet code] Palindrome Number
- 【Leet Code】Palindrome Number
- CODE 2: Palindrome Partitioning
- palindrome-partitioning Java code
- palindrome-partitioning Java code
- Leet Code 9 Palindrome Number
- 【LEET-CODE】9. Palindrome Number
- CODE 1: Palindrome Partitioning II
- leetcode 日经贴,Cpp code -Palindrome Partitioning II
- leetcode 日经贴,Cpp code -Palindrome Partitioning
- Leet Code OJ 125. Valid Palindrome [Difficulty: Easy]
- Palindrome partitioning
- Palindrome Partitioning
- Palindrome Partitioning
- Palindrome Partitioning
- Palindrome Partitioning
- Palindrome Partitioning
- Codeforces Round #230 (Div. 2)A. Nineteen
- slidingmenu开源效果
- js中top、clientTop、scrollTop、offsetTop的区别
- 产品使用技术小结
- boost线程创建方式总结
- [leet code] Palindrome Partitioning
- xml文件的读写
- unresolved external symbol __forceAtlDllManifest错误的解决
- org.gjt.xpp.XmlPullParserException 错误解决
- linux 帮助命令
- 快速理解Kafka分布式消息队列框架
- wordpress+nat123迅速学会搭建并发布个人博客网站
- UVa 10061 多少个零和数字?
- Boost.Function内核剖析