LeetCode - 459. Repeated Substring Pattern - O(n)和O(n^2)两种思路 - KMP - (C++) - 解题报告
2016-11-19 23:33
573 查看
题目
题目链接Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.
Example 1:
Input: "abab"
Output: True
Explanation: It's the substring "ab" twice.
Example 2:
Input: "aba"
Output: False
Example 3:
Input: "abcabcabcabc"
Output: True
Explanation: It's the substring "abc" four times. (And the substring "abcabc" twice.)
给定一个没有空格的的字符串,查看该字符串是否由其中的一个子串重复多次得到。给定的字符串中只有小写的英文字母,而且长度不超过10000.
例子 1:
输入: "abab"
输出: True
解释:这是由子串"ab"重复得到
例子 2:
输入: "aba"
输出: False
例子3 3:
输入: "abcabcabcabc"
输出: True
解释:这是由子串"abc"重复四次得到的,也可以认为是"abcabc重复两次得到的"
代码
1.O(n^2)解法
class Solution { public: bool repeatedSubstringPattern(string str) { int m=str.size(); for(int p=1;p<m/2+1;p++) for(int i=0;i<m-p;i++) { if(str[i]!=str[i+p]) break; if(m%p==0&&i==m-p-1) return true; } return false; } };
2.O(n)解法
解法链接这是其他人post到讨论区的解法,基于KMP思想做的,时间复杂性比较好。KMP算法可以参考这个链接class Solution { public: bool repeatedSubstringPattern(string str) { int i = 1, j = 0, n = str.size(); vector<int> dp(n+1,0); while( i < str.size() ){ if( str[i] == str[j] ) dp[++i]=++j; else if( j == 0 ) i++; else j = dp[j]; } return dp &&dp %(n-dp )==0; }
相关文章推荐
- LeetCode - 136. Single Number - ( C++ ) - 解题报告 - 位运算思路 xor
- [leetcode] 291. Word Pattern II 解题报告
- LeetCode - 389. Find the Difference - 三种不同解法 - ( C++ ) - 解题报告
- 【LeetCode】290.Word Pattern解题报告
- 【LeetCode】Word Pattern 解题报告
- 【LeetCode】291.Word Pattern II(Hard)解题报告
- [Leetcode] 291. Word Pattern II 解题报告
- LeetCode - 167. Two Sum II - Input array is sorted - O(n) - ( C++ ) - 解题报告
- Leetcode / C++ / 502. IPO 解题报告+源代码
- LeetCode - 268. Missing Number - stable_sort应用实例 - ( C++ ) - 解题报告
- LeetCode C++ 解题报告
- LeetCode - 413. Arithmetic Slices - 含中文题意解释 - O(n) - ( C++ ) - 解题报告
- LeetCode - 463. Island Perimeter - O(MN)- (C++) - 解题报告
- 【LeetCode】Repeated Substring Pattern 解题报告
- LeetCode解题报告—— 1-bit and 2-bit Characters & 132 Pattern & 3Sum
- [Leetcode] 290. Word Pattern 解题报告
- [Leetcode] 456. 132 Pattern 解题报告
- Leetcode 456. 132 Pattern 123模式 解题报告
- LeetCode - 13. Roman to Integer - 思考if-else与switch的比较 - ( C++ ) - 解题报告
- LeetCode - 412. Fizz Buzz - ( C++ ) - 解题报告 - to_string