LintCode-136.Palindrome Partitioning
[http://www.lintcode.com/en/problem/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.
> Example: Given s = "aab", return:
[
["aa","b"],
["a","a","b"]
]
public class Solution {
/**
* @param s: A string