我的代码在MS VS 2012中编译后,接受输入,然后使用以下报告崩溃:
Debug Assertion Failed!
...\include\xstring
Line:1662
Expression:string subscript out of range
代码如下:
#include "stdafx.h"
#include <iostream>
#include <string>
#include <vector>
#include <cassert>
#include <time.h>
using namespace std;
const unsigned short MAX_STRINGS = 10;
const unsigned int MAX_SIZE=10000;
vector<string> strings;
unsigned int len;
string GetLongestCommonSubstring( string string1, string string2 );
inline void readNumberSubstrings();
inline const string getMaxSubstring();
void readNumberSubstrings()
{
cin >> len;
assert(len > 1 && len <=MAX_STRINGS);
strings.resize(len);
for(unsigned int i=0; i<len;i++)
strings[i]=string(MAX_SIZE,0);
for(unsigned int i=0; i<len; i++)
cin>>strings[i];
}
const string getMaxSubstring()
{
string maxSubstring=strings[0];
long T=clock();
for(unsigned int i=1; i < len; i++)
maxSubstring=GetLongestCommonSubstring(maxSubstring, strings[i]);
cout << clock()-T << endl;
return maxSubstring;
}
string GetLongestCommonSubstring( string string1, string string2 )
{
const int solution_size = string2.length()+ 1;
int *x=new int[solution_size]();
int *y= new int[solution_size]();
int **previous = &x;
int **current = &y;
unsigned int max_length = 0;
unsigned int result_index = 0;
unsigned int j;
unsigned int length;
int J=string2.length() - 1;
for(unsigned int i = string1.length() - 1; i >= 0; i--)
{
for(j = J; j >= 0; j--)
{
if(string1[i] != string2[j])
(*current)[j] = 0;
else
{
length = 1 + (*previous)[j + 1];
if (length > max_length)
{
max_length = length;
result_index = i;
}
(*current)[j] = length;
}
}
swap(previous, current);
}
string1[max_length+result_index]='\0';
return &(string1[result_index]);
}
int main()
{
readNumberSubstrings();
cout << getMaxSubstring() << endl;
return 0;
}
我想它必须是非常简单的东西(比如一些循环条件或类似东西)导致它崩溃,但我看不到它。
答案 0 :(得分:6)
您的问题在于使用unsigned int
。看看这一行:
for(j = J; j >= 0; j--)
这里,在j变为0之后,它会减少。但是您的j
为unsigned
,因此-1
成为j
而不是成为4158584613
(并在下一次迭代中退出循环),并且循环继续,尝试在此行访问索引4158584613
处明显不符合要求的元素:
(*current)[j] = 0;
签署i
,j
和length
会解决您的问题。
答案 1 :(得分:0)
我将它加载到我的本地Visual Studio 2008上的测试解决方案中,并在i和j中将int替换为unsigned int并且运行
#include "stdafx.h"
#include <iostream>
#include <string>
#include <vector>
#include <cassert>
#include <time.h>
using namespace std;
const unsigned short MAX_STRINGS = 10;
const unsigned int MAX_SIZE=10000;
vector<string> strings;
unsigned int len;
string GetLongestCommonSubstring( string string1, string string2 );
inline void readNumberSubstrings();
inline const string getMaxSubstring();
void readNumberSubstrings()
{
cin >> len;
assert(len > 1 && len <=MAX_STRINGS);
strings.resize(len);
for(unsigned int i=0; i<len;i++)
strings[i]=string(MAX_SIZE,0);
for(unsigned int i=0; i<len; i++)
cin>>strings[i];
}
const string getMaxSubstring()
{
string maxSubstring=strings[0];
long T=clock();
for(unsigned int i=1; i < len; i++)
maxSubstring=GetLongestCommonSubstring(maxSubstring, strings[i]);
cout << clock()-T << endl;
return maxSubstring;
}
string GetLongestCommonSubstring( string string1, string string2 )
{
const int solution_size = string2.length()+ 1;
int *x=new int[solution_size]();
int *y= new int[solution_size]();
int **previous = &x;
int **current = &y;
unsigned int max_length = 0;
unsigned int result_index = 0;
int j;
unsigned int length;
int J=string2.length() - 1;
for(int i = string1.length() - 1; i >= 0; i--)
{
for(j = J; j >= 0; j--)
{
if(string1[i] != string2[j])
(*current)[j] = 0;
else
{
length = 1 + (*previous)[j + 1];
if (length > max_length)
{
max_length = length;
result_index = i;
}
(*current)[j] = length;
}
}
swap(previous, current);
}
string1[max_length+result_index]='\0';
return &(string1[result_index]);
}
int main()
{
readNumberSubstrings();
cout << getMaxSubstring() << endl;
return 0;
}
由于 Niraj Rathi