From d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa Mon Sep 17 00:00:00 2001 From: jack <0x6A73@pm.me> Date: Fri, 14 Jun 2024 13:13:15 -0600 Subject: initial --- repeated_substring_pattern.cpp | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 repeated_substring_pattern.cpp (limited to 'repeated_substring_pattern.cpp') diff --git a/repeated_substring_pattern.cpp b/repeated_substring_pattern.cpp new file mode 100644 index 0000000..4e2d8d8 --- /dev/null +++ b/repeated_substring_pattern.cpp @@ -0,0 +1,31 @@ +// 459. Repeated Substring Pattern +#include "leetcode.h" + +/* + * given a string 's', check if it can be constructed by taking a substring of + * it and appending multiple copies of the substring together. + */ + +class Solution { +public: + bool repeatedSubstringPattern(string s) { + int i = 1, j = 0, n = s.size(); + vector dp(n + 1, 0); + while (i < n) { + if (s[i] == s[j]) + dp[++i] = ++j; + else if (!j) + i++; + else + j = dp[j]; + } + return dp[n] && dp[n] % (n - dp[n]) == 0; + } +}; + +int main() { + Solution obj; + printf("%d\n", obj.repeatedSubstringPattern("abab")); // expect: 1 + printf("%d\n", obj.repeatedSubstringPattern("aba")); // expect: 0 + printf("%d\n", obj.repeatedSubstringPattern("abcabcabcabc")); // expect: 1 +} -- cgit v1.2.3