字符串中查找子串,并返回子串相对字符换的位置

int FindSubstring(const char* all, const char* sub)
{
	int all_len = strlen(all);
	int sub_len = strlen(sub);
	int i = 0, j = 0;
	for (;i<all_len;++i)
	{
		if (all[i] == sub[0])
		{
			for (j=1; j<sub_len; ++j)
			{
				if (sub[j]==all[++i])
				{
					continue;
				}
				else
				{
					break;
				}
			}
			if (j == sub_len)
			{
				return (i-sub_len+1);
			}
		}
	}
	return -1;
}

int main()
{

    const char* all = "hello";
    const char* sub = "el";
    int npos = FindSubstring(all, sub);//npos = 1;
}

猜你喜欢

转载自blog.csdn.net/jiaojinlin/article/details/86633172