1、原版的前缀表(不减一)的C++代码实现:
#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
void getNext(int* next, const string& s) {
next[0] = 0;
int j = 0;
for (int i = 1; i < s.size(); i++) {
while (j > 0 && s[i] != s[j]) {
j = next[j - 1];
}
if (s[i] == s[j]) {
j++;
}
next[i] = j;
}
}
bool repeatedSubstringPattern(string s) {
if (s.size() == 0) {
return false;
}
int next[s.size()];
getNext(next, s);
int len = s.size();
if (next[len - 1] != 0 && len % (len - next[len - 1]) == 0) {
return true;
}
return false;
}
};
int main() {
Solution solution;
string s = "abcabcabcabc";
bool result = solution.repeatedSubstringPattern(s);
cout << "Repeated Substring Pattern: " << (result ? "True" : "False") << endl;
return 0;
}
在力扣上能运行,但是在VS上不能运行。
2、能运行的代码
#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
void getNext(int* next, const string& s) {
next[0] = 0;
int j = 0;
for (int i = 1; i < s.size(); i++) {
while (j > 0 && s[i] != s[j]) {
j = next[j - 1];
}
if (s[i] == s[j]) {
j++;
}
next[i] = j;
}
}
bool repeatedSubstringPattern(string s) {
if (s.size() == 0) {
return false;
}
int* next = new int[s.size()]; //改动处
getNext(next, s);
int len = s.size();
if (next[len - 1] != 0 && len % (len - next[len - 1]) == 0) {
delete[] next;//改动处
return true;
}
delete[] next;//改动处
return false;
}
};
int main() {
Solution solution;
string s = "abcabcabcabc";
bool result = solution.repeatedSubstringPattern(s);
cout << "Repeated Substring Pattern: " << (result ? "True" : "False") << endl;
return 0;
}
在这个修改后的代码中,使用new
关键字动态分配了一个整型数组next
,其大小为s.size()
,并在函数结束后使用delete[]
释放了内存。