C++实现字符串的分割和替换

//替换指定的子串
//src:原字符串 target:待被替换的子串 subs:替换的子串
string replaceALL(const char* src, const string& target,const string& subs) 
{
	string tmp(src);
	string::size_type pos =tmp.find(target),targetSize =target.size(),resSize =subs.size();  
	while(pos!=string::npos)//found  
	{  
		tmp.replace(pos,targetSize,subs);
		pos =tmp.find(target, pos + resSize);
	}
	return tmp;
}

//qsort函数需要的比较函数，按照升序排序
int comp(const void*a,const void*b)
{
	return *(int*)a-*(int*)b;
}

//按指定分隔符分割字符串
//src:源字符串 delimiter:分隔符集合
vector<string> split(const string& src,const string& delimiter) 
{
	vector<string> strRes;
	int maxSubstrNum=src.size();
	int* pos=new int[maxSubstrNum];
	memset(pos,0,maxSubstrNum*sizeof(int));
	
	int j=0;
	for(size_t i=0;i<delimiter.size();++i)
	{
		string::size_type index=src.find(delimiter[i]);
		while(index!=string::npos)
		{
			pos[j++]=index;
			index=src.find(delimiter[i],index+1);
		}		
	}
	//排序
	qsort(pos,j,sizeof(int),comp);
	//取出第一个子串
	string substrFir=src.substr(0,pos[0]);
	if(substrFir!="")
		strRes.push_back(substrFir);
	//取出中间j-1个子串
	for(int i=0;i<j-1;++i)
	{
		string substr=src.substr(pos[i]+1,pos[i+1]-pos[i]-1);
		if(substr!="")
			strRes.push_back(substr);
	}
	//取出最后一个子串
	string substrLast=src.substr(pos[j-1]+1,src.size()-pos[j-1]-1);
	if(substrLast!="")
		strRes.push_back(substrLast);	
	delete[] pos;
	return strRes;
}