0459 solved.

Author: liuyubobobo

0001-0500/0459-Repeated-Substring-Pattern/cpp-0459/CMakeLists.txt

@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.25)
+project(cpp_0459)
+
+set(CMAKE_CXX_STANDARD 17)
+
+add_executable(cpp_0459 main.cpp)

0001-0500/0459-Repeated-Substring-Pattern/cpp-0459/main.cpp

@@ -0,0 +1,43 @@
+/// Source : https://leetcode.com/problems/repeated-substring-pattern/description/
+/// Author : liuyubobobo
+/// Time   : 2023-08-21
+
+#include <iostream>
+
+using namespace std;
+
+
+/// Brute Force
+/// Time Complexity: O(sqrt(n) * n)
+/// Space Complexity: O(n)
+class Solution {
+public:
+    bool repeatedSubstringPattern(string s) {
+
+        int n = s.size();
+        if(n == 1) return false;
+        for(int i = 1; i * i <= n; i ++){
+            if(n % i) continue;
+
+            if(ok(n, s, i)) return true;
+
+            if(i * i == n || i == 1) continue;
+            if(ok(n, s, n / i)) return true;
+        }
+        return false;
+    }
+
+private:
+    bool ok(int n, const string& s, int len){
+        string subs = s.substr(0, len);
+        for(int i = len; i <= n - len; i += len)
+            if(s.substr(i, len) != subs) return false;
+        return true;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}

readme.md

@@ -493,7 +493,7 @@ email: [[email protected]](mailto:[email protected])
 | 456 | [132 Pattern](https://leetcode.com/problems/132-pattern/) | [solution](https://leetcode.com/problems/132-pattern/solution/) <br/> [缺：O(n) 单调栈算法] | [C++](0001-0500/0456-132-Pattern/cpp-0456/) | | |
 | 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop/) | [无] | [C++](0001-0500/0457-Circular-Array-Loop/cpp-0457/) | | |
 | 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs/) | [solution](https://leetcode.com/problems/poor-pigs/solution/) | [C++](0001-0500/0458-Poor-Pigs/) | | |
-| | | | | | |
+| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/description/) | [无] | [C++](0001-0500/0459-Repeated-Substring-Pattern/cpp-0459/) | | |
 | 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache/description/) | [solution](https://leetcode.com/problems/lfu-cache/solutions/2815229/lfu-cache/?orderBy=most_votes) | [C++](0001-0500/0460-LFU-Cache/) | | |
 | 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [solution](https://leetcode.com/problems/hamming-distance/solution/) | [C++](0001-0500/0461-Hamming-Distance/cpp-0461/) | | |
 | 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | [solution](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/solution/) | [C++](0001-0500/0462-Minimum-Moves-to-Equal-Array-Elements-II/cpp-0462/) | | |