leetcode： 字符串

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

给定一个字符串，将字符串分成多个部分，满足每一部分都是回文串，请输出所有可能的情况

leetcode： 字符串

原文：http://www.cnblogs.com/zxqstrong/p/5336418.html