diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/repeated_substring_pattern.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/repeated_substring_pattern.cpp')
-rw-r--r-- | other/repeated_substring_pattern.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/repeated_substring_pattern.cpp b/other/repeated_substring_pattern.cpp deleted file mode 100644 index 4e2d8d8..0000000 --- a/other/repeated_substring_pattern.cpp +++ /dev/null @@ -1,31 +0,0 @@ -// 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<int> 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 -} |