C语言模拟实现库函数：strstr、strcat、strcmp、strcpy、strlen、memmove、memcpy

最新推荐文章于 2024-06-20 20:35:16 发布

爱写代码的阿松

最新推荐文章于 2024-06-20 20:35:16 发布

阅读量112

点赞数

文章标签： c++ c语言开发语言

本文链接：https://blog.csdn.net/m0_52280091/article/details/126267856

版权

模拟实现库函数：strstr

//模拟实现strstr
char* my_strstr(const char* str1, const char* str2)
{
	assert(str1&&str2);

	char* s1 = str1;
	char* s2 = str2;
	
	char* cur = s1;
	while (*cur)
	{
		s1 = cur;
		s2 = str2;
		while (*s1 && *s2 && (*s1 == *s2))
		{
			s1++;
			s2++;
		}
		if (*s2 == '\0')
			return (char*)cur;
		cur++;
	}
	return NULL;//找不到
}

int main()
{
	char arr1[] = "abbcdef";
	char arr2[] = "bcdef";
	char* ret = my_strstr(arr1, arr2);
	if (NULL == ret)
	{
		printf("找不到子串\n");
	}
	else
		printf("%s\n", ret);
	return 0;
}

模拟实现库函数：strcat

void my_strcat(char* str1, char* str2)
{
	assert(str1&&str2);

	int len = strlen(str1);
	int i = 0;
	for(i = 0; i < strlen(str2); i++)
	{
		*(str1 + len + i) = *(str2 + i);
	}
}
char* my_strcat(char* dest, char* src)
{
	assert(dest&&src);

	char* ret = dest;
	while (*dest)
	{
		dest++;
	}

	while (*dest++ = *src++)
	{
		;
	}
	return ret;
}

int main()
{
	char arr1[20] = "hello ";
	char arr2[] = "china";
	char* ret = my_strcat(arr1, arr2);
	printf("%s\n", ret);
	return 0;
}

模拟实现库函数：strcmp

//模拟实现strcmp
int my_strcmp(const char* str1, const char* str2)
{
	assert(str1&&str2);
	while (*str1++ == *str2++)
	{
		if (*str1 == '\0')
			return 0;
		/*str1++;
		str2++;*/
	}
	if (*str1 > *str2)
		return 1;
	else
		return -1;
}

int main()
{
	char arr1[] = "abc";
	char arr2[] = "abd";
	int ret = my_strcmp(arr1, arr2);
	if (ret > 0)
		printf("arr1>arr2\n");
	else if (ret < 0)
		printf("arr1<arr2\n");
	else
		printf("arr1=arr2\n");
	return 0;
}

模拟实现库函数：strcpy

//模拟实现strcpy
char* my_strcpy(char* dest, const char* src)
{
	assert(dest&&src);

	char* ret = dest;
	while (*dest++ = *src++)
	{
		;
	}

	return ret;
}

int main()
{
	char arr1[20] = "ss";
	char arr2[] = "hello china";
	int ret = my_strcpy(arr1, arr2);
	printf("%s\n", ret);
	return 0;
}

模拟实现库函数：strlen（计数法、递归和指针-指针）

//模拟实现strlen
//计数器
int my_strlen1(const char* ch)
{
	assert(ch);
	int count = 0;
	while (*ch++)
	{
		count++;
	}
	return count;
}

//递归
int my_strlen(const char* ch)
{
	assert(ch);
	if (*ch != '\0')
	{
		return 1 + my_strlen(ch + 1);
	}
	else
		return 0;
}

//指针-指针
int my_strlen3(const char* ch)
{
	assert(ch);
	char* left = ch;
	while (*ch)
	{
		ch++;
	}
	return ch - left;
}

int main()
{
	char ch[] = "djs";
	int len = my_strlen(ch);
	printf("%d\n", len);
	return 0;
}

模拟实现库函数：memmove

//模拟实现memmove
void* my_memmove(void* dest, void* src, size_t count)
{
	assert(dest&&src);

	void* ret = dest;
	if (dest > src)
	{
		while (count--)
		{
			*((char*)dest + count) = *((char*)src + count);
		}
	}
	else
	{
		while (count--)
		{
			*((char*)dest)++ = *((char*)src)++;
		}
	}
	return ret;
}
int main()
{
	int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
	my_memmove(arr + 2, arr, 20);
	int i = 0;
	for (i = 0; i < 10; i++)
	{
		printf("%d ", *(arr + i));
	}
	printf("\n");
	return 0;
}

模拟实现库函数：memcpy

//模拟实现memcpy
void* my_memcpy(void* dest, void* src, size_t count)
{
	assert(dest&&src);

	void* ret = dest;
	while (count--)
	{
		*((char*)dest)++ = *((char*)src)++;
	}
	return ret;
}

int main()
{
	int arr1[20] = { 1,2,3,4,5,6 };
	int arr2[] = { 3,4,5,6,7 };

	my_memcpy(arr1, arr2, 4);
	int sz = sizeof(arr1) / sizeof(arr1[0]);
	int i = 0;
	for (i = 0; i < sz; i++)
	{
		printf("%d ", arr1[i]);
	}
	return 0;
}