[LeetCode Solution 131]: Palindrome Partitioning ********************************************************************************* Question: 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"] ] -------------------------------------------------------------------------------------------------- Recursive Method Strategy We are going to use backtracking to solve this problem, the idea is if we find a palindrome substring, we add it in a temp and go further searching, the idea is as shows in the following picture: Java public class Solution { public List<List<String>> partition(String s) { if (s.length() == 0 || s == null) return null; List<List<String>> res = new ArrayList...