fd

Author: dingjikerbo

README.md

@@ -356,6 +356,7 @@
 |449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SerializeAndDeserializeBST.java)|90|和#297一样|
 |450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/DeleteNodeInBST.java)|60|这题非常经典，值得多做十遍|
 |451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SortCharactersByFrequency.java)|||
+|459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/RepeatedSubstringPattern.java)|||
 |477|[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/TotalHammingDistance.java)||
 |480|[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SlidingWindowMedian.java)|70||
 |482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LicenseKeyFormatting.java)|90||

solution/src/main/java/com/inuker/solution/RepeatedSubstringPattern.java

@@ -0,0 +1,27 @@
+package com.inuker.solution;
+
+/**
+ * Created by liwentian on 2017/12/9.
+ */
+
+public class RepeatedSubstringPattern {
+
+    /**
+     * 先从重复两次开始试，再试重复3次，一直到重复1次
+     */
+    public boolean repeatedSubstringPattern(String str) {
+        int l = str.length();
+        for (int i = l / 2; i >= 1; i--) {
+            if (l % i == 0) {
+                int m = l / i;
+                String subS = str.substring(0, i);
+                StringBuilder sb = new StringBuilder();
+                for (int j = 0; j < m; j++) {
+                    sb.append(subS);
+                }
+                if (sb.toString().equals(str)) return true;
+            }
+        }
+        return false;
+    }
+}