repeated substring patterns

Author: chen0040

.idea/workspace.xml

@@ -402,8 +402,10 @@ codes may not be optimized
 
 1. [Path Sum III](https://leetcode.com/problems/path-sum-iii/description/)
 1. [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/description/)
+1. [Repeated Substring Patterns](https://leetcode.com/problems/repeated-substring-pattern/description/)
 
 ### Day 19 - Medium
 
 1. [Path Sum II](https://leetcode.com/problems/path-sum-ii/description/)
 1. [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/description/)
+

README.md

@@ -0,0 +1,26 @@
+package com.github.chen0040.leetcode.day19.easy;
+
+
+/**
+ * Created by xschen on 14/8/2017.
+ *
+ * link: https://leetcode.com/problems/repeated-substring-pattern/description/
+ */
+public class RepeatedSubstringPatterns {
+   public class Solution {
+      public boolean repeatedSubstringPattern(String s) {
+         for(int i = s.length() / 2; i >= 1;--i) {
+            if(s.length() % i == 0) {
+               int count = s.length() / i;
+               String comp = s.substring(0, i);
+               StringBuilder sb = new StringBuilder();
+               for(int j = 0; j < count; ++j) {
+                  sb.append(comp);
+               }
+               if(sb.toString().equals(s)) return true;
+            }
+         }
+         return false;
+      }
+   }
+}