fd

liwentian · liwentian · commit a9e2364ad771 · 2017-09-06T10:00:50.000+08:00
diff --git a/README.md b/README.md
@@ -214,7 +214,7 @@
 |264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/UglyNumberII.java)|70|
 |265|[Paint House II](https://leetcode.com/problems/paint-house-ii)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PaintHouseII.java)|60|
 |266|[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PalindromePermutation.java)|100|
-|267|[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/)|||
+|267|[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PalindromePermutationII.java)|80|典型，多看两遍|
 |269|[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/AlienDictionary.java)|70|这题要多做几遍|
 |270|[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ClosestBinarySearchTreeValue.java)|90|
 |271|[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/EncodeAndDecodeStrings.java)|65|思路巧妙，多看几遍|
diff --git a/test/src/main/java/com/example/Main.java b/test/src/main/java/com/example/Main.java
@@ -27,52 +27,6 @@
 public class Main {
 
     public static void main(String[] args) {
-        List<String> list = generatePalindromes("a");
-        for (String s : list) {
-            System.out.println("(" + s+")");
-        }
-    }
-
-    public static List<String> generatePalindromes(String s) {
-        int[] counts = new int[256];
-        for (char c : s.toCharArray()) {
-            counts[c]++;
-        }
-        List<String> list = new LinkedList<>();
-        StringBuilder sb = new StringBuilder();
-        char single = 0;
-        for (int i = 0; i < counts.length; i++) {
-            if (counts[i] % 2 != 0) {
-                if (single != 0) {
-                    return list;
-                }
-                single = (char) i;
-                counts[i] = ((counts[i] >> 1) << 1);
-            }
-            for (int j = 0; j < counts[i]; j += 2) {
-                sb.append((char)i);
-            }
-        }
-
-        helper(sb, "" + (single != 0 ? single : ""), list);
-        return list;
-    }
-
-    private static void helper(StringBuilder sb, String cur, List<String> list) {
-        if (sb.length() == 0) {
-            list.add(cur);
-            return;
-        }
-
-        for (int i = 0; i < sb.length(); i++) {
-            if (i > 0 && sb.charAt(i) == sb.charAt(i - 1)) {
-                continue;
-            }
-            char c = sb.charAt(i);
-            sb.deleteCharAt(i);
-            helper(sb, c + cur + c, list);
-            sb.insert(i, c);
-        }
     }
 }
 
