查找子串位置

#include "iostream"
using namespace std;
int fun(char *p,char *q)
{
    int num1=0,num2=0;
	char *p1=p;
	char *q1=q;
	while (*p1++!='\0')
	{
		num1++;
		
	}
    cout<<"num1:"<<num1<<endl;
	cout<<"p:"<<p<<endl;
	while (*q1++!='\0')
	{
		num2++;
	}
	cout<<"num2:"<<num2<<endl;
    cout<<"q:"<<q<<endl;
     
	 char *temp=new char[num2+1];
	 for (int i=0;i<num1-num2+1;i++)
	 {
		 
		 for (int j=0;j<num2;j++)
		 {
			 *(temp+j)=*(p+i+j);
			
		 }
		 *(temp+num2)='\0';
		 if (strcmp(temp,q)==0)
		 {
			 return i;
		 }
		 
	 }
	 if (i>=num1-num2+1)
	 {
		 return -1;
	 }

	 delete[]temp;

}
int main(void)
{
	char *pIn="12345abc";
	char *qIn="ab";
	int num=fun(pIn,qIn);
	cout<<num<<endl;
	return 0;
}