【LeetCode】267.Palindrome Permutation II(Medium)解题报告

【LeetCode】267.Palindrome Permutation II(Medium)解题报告

题目地址：https://leetcode.com/problems/palindrome-permutation-ii/
题目描述：

  Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.
  For example:
  Given s = “aabb”, return [“abba”, “baab”].
  Given s = “abc”, return [].

Solution:

Date：2018年1月30日