两个字符串包含算法

#include<iostream>
#include<string>
using namespace std;

//O(n*m)的轮询方法

int CompareString(string LongString,string ShortString)
{
	int i,j;
	for(i=0;i<ShortString.length();i++)
	{
		for(j=0;j<LongString.length();j++)
		{
			if(LongString[j]==ShortString[i])
			{
				break;
			}
		}
		if(j==LongString.length())
		{
			cout<<"false"<<endl;
			return 0;
		}
	}
	cout<<"true"<<endl;
	return 1;
}
int main()
{
	
	string LongString="DACBEFGHMNOPQRS";
	string ShortString="GCSRQPO";
	CompareString(LongString,ShortString);
	return 0;
}
//--O(mlogm)+0(nlogn)+O(m+n)的先快速排序在比较
#include<iostream>
#include<string>
using namespace std;

//对字符串快速排序
int partition(string &str,int lo,int hi)
{
	int key=str[hi];
	int i=lo-1;
	for(int j=lo;j<hi;j++)
	{
		if(str[j]<=key)
		{
			i++;
			swap(str[i],str[j]);
		}
	}
	swap(str[i+1],str[hi]);
	return i+1;
}

void quicksort(string &str,int lo,int hi)
{
	if(lo<hi)
	{
		int k=partition(str,lo,hi);
		quicksort(str,lo,k-1);
		quicksort(str,k+1,hi);
	}
	
}
//比较两个有序的字符串

void compare(string str1,string str2)
{
	int posOne = 0;
	int posTwo = 0;
	while(posTwo<str2.length() && posOne<str1.length())
	{
		while(str1[posOne]<str2[posTwo] &&posOne<str1.length()-1)
			posOne++;
		if(str1[posOne]!=str2[posTwo])
			break;
		posTwo++;
	}
	if(posTwo==str2.length())
		cout<<"true"<<endl;
	else
		cout<<"false"<<endl;
}

int main()
{
	
	string LongString="RCADBEFGHMNOPQS";
	string ShortString="GCSRQPO";
	quicksort(LongString,0,LongString.length()-1);
	quicksort(ShortString,0,ShortString.length()-1);
	compare(LongString,ShortString);
	return 0;
}


















//O(m+n)的计数排序
#include<iostream>
#include<string>
using namespace std;

//计数排序O(n+m)

void CounterSort(string str,string &help_str)
{
	int help[26]={0};
	for(int i=0;i<str.length();i++)
	{
		int index = str[i]-‘A‘;
		help[index]++;
	}

	for(int j=1;j<26;j++)
		help[j]+=help[j-1];
	for(int k = str.length()-1;k>=0;k--)
	{
		int index = str[k]-‘A‘;
		int pos = help[index]-1;
		help_str[pos]=str[k];
		help[index]--;
	}

}



void compare(string str1,string str2)
{
	int posOne = 0;
	int posTwo = 0;
	while(posTwo<str2.length() && posOne<str1.length())
	{
		while(str1[posOne]<str2[posTwo] &&posOne<str1.length()-1)
			posOne++;
		if(str1[posOne]!=str2[posTwo])
			break;
		posTwo++;
	}
	if(posTwo==str2.length())
		cout<<"true"<<endl;
	else
		cout<<"false"<<endl;
}

int main()
{
	
	string LongString="RCADBEFGHMANOPQS";
	string ShortString="GCSRQPO";
	string str_1=LongString;
	string str_2=ShortString;
	CounterSort(LongString,str_1);
	CounterSort(ShortString,str_2);
	compare(str_1,str_2);
	return 0;
}







两个字符串包含算法,布布扣,bubuko.com
两个字符串包含算法
原文：http://blog.csdn.net/woailvmengmeng/article/details/23263107