> 郁闷死了，谁能帮我看一下？
> 
> #include <iostream>
> #include <string>
> #include <vector>
> using namespace std;
> 
> int main()
> {
> 	while(1)
> 	{
> 		vector<string> dic;
> 		string word;
> 		cin>>word;
> 		while(word != "#")
> 		{
> 			dic.push_back(word);
> 			cin>>word;
> 		}
> 		
> 		string checked;
> 		cin>>checked;
> 		while(checked != "#")
> 		{
> 			int length = checked.length();
> 			vector<string> replace;
> 			for(int i = 0; i < dic.size(); i++)
> 			{
> 				int lengthi = dic[i].length();
> 				switch(lengthi-length){
> 				case 0:
> 				{
> 					if(dic[i] == checked)
> 					{
> 						cout<<checked<<" is correct"<<endl;
> 						goto END;
> 					}
> 					else	// check replace
> 					{
> 						for(int j = 0; j < length; j++)
> 							if(checked[j] != dic[i][j])
> 							{
> 								if(j == length-1 || checked.substr(j+1) == dic[i].substr(j+1))
> 									replace.push_back(dic[i]);
> 								break;
> 							}
> 					}
> 					break;
> 				}
> 				case 1:	// check insert
> 				{				
> 					for(int j = 0; j < length; j++)
> 						if(checked[j] != dic[i][j])
> 						{
> 							if(checked.substr(j) == dic[i].substr(j+1))
> 								replace.push_back(dic[i]);
> 							break;
> 						}
> 					if(j == length)	// insert at end
> 						replace.push_back(dic[i]);
> 					break;
> 				}
> 				case -1:	// check delete
> 				{
> 					for(int j = 0; j < lengthi; j++)
> 						if(checked[j] != dic[i][j])
> 						{
> 							if(checked.substr(j+1) == dic[i].substr(j))
> 								replace.push_back(dic[i]);
> 							break;
> 						}
> 					if(j == lengthi)	// delete at end
> 						replace.push_back(dic[i]);
> 					break;				
> 				}
> 				default:	// no replacement could be done
> 					;
> 				} 
> 			}
> 			END:
> 			if(i == dic.size())	// not correct, find replacements
> 			{
> 				cout<<checked<<':';
> 				if(replace.size() == 0)
> 					cout<<endl;
> 				else
> 				{
> 					for(int j = 0; j < replace.size(); j++)
> 						cout<<' '<<replace[j];
> 					cout<<endl;
> 				}
> 			}
> 			cin>>checked;
> 		}
> 	}
> }

• Re:vector每次分配的时候都是1.5倍的，估计string也是，这个极容易超的 (49) yarrow 2005-04-15 20:33:53
  • 对，一般是数组越界或者递归溢出 (55) hawk 2005-04-15 22:27:53
• 用reserve，预先申请空间 (0) yangguo981 2006-04-20 11:31:15