标签：nbsp inpu ble sub pos output art ring put
Given a string s, partition s such that every substring of the partition is a palindrome.
Return all possible palindrome partitioning of s.
Example:
Input: "aab"
Output:
[
["aa","b"],
["a","a","b"]
]
复杂度：
131. Palindrome Partitioning 131.回文分区
标签：nbsp inpu ble sub pos output art ring put
原文地址：https://www.cnblogs.com/immiao0319/p/13222322.html
