My_Jobs的专栏

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

回溯法入门，求一个集合的全排列，比如{2,3,5}的全排列为：[[2, 3, 5], [2, 5, 3], [3, 2, 5], [3, 5, 2], [5, 3, 2], [5, 2, 3]] 代码如下： public class AllPermutations { public void allPermutations(List> lists, Integer[] a, int cur)

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", dict = ["leet"

三种不同的方式，生产一个集合的所有子集，回溯法、迭代法。。。