在A字符串中找出所有在B字符串也出现过的字符

 

 

#include <iostream>
using namespace std;

char* findchar( const char * pa, const char * pb);

int main()
{
	char pa[] = "hjlkfjajefjlfjljvlkjl";
	char pb[] = "jeukc.eo!@#$%^kjlf";
	cout << findchar(pa, pb);
	cout << endl;
	return 0;
}

char* findchar( const char * pa, const char * pb )
{
#define MAX 256
	if ( pa == NULL || pb == NULL )
		return false;
	bool tmpb[MAX+1] = { false };
	static char tmpc[MAX] = { 0 };
	char * tmpp = tmpc;
	while ( *pb != 0 )
	{
		tmpb[*pb] = 1;
		pb++;
	}

	while ( *pa != 0 )
	{
		if ( tmpb[*pa] )
		{
			tmpb[*pa] = false;
			*tmpp = *pa;
			tmpp++;
		}
		pa++;
	}

	return tmpc;
}