在字符串中查找子串

#include<iostream>
#include<stdlib.h>
using namespace  std;
class Solution
{
public:
	char  *strFind(char * string, char *substring)
	{
		if (string == NULL &&substring == NULL)
			return NULL;
		int m = strlen(string);
		int n = strlen(substring);
		int j;
		if (m < n)
			return NULL;
		for (int i = 0; i <= m - n; i++)
		{
			for (j = 0; j <= m - n; j++)
			{
				if (string[i + j] != substring[j])
					break;
			}
			if (j == n)
				return string + i;

		}
	}
};

void main()
{
	char *string = "ababcabcacbab";
	char *substring = "abcac";
	Solution S1;
	cout<<S1.strFind(string, substring);
	system("pause");

}

使用最基础的BF算法，时间复杂度为O（（m-n+1）*n）