131. 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"]
]

解题思路

见程序注释