模拟实现strcpy,strcmp,strcat,strstr,strchr,memcpy,memmove(day8)

#include<stdio.h>
#include<string.h>
#include<assert.h>
char *Strcpy(char *dest, const char* src)
{
	char *ret = dest;
	assert(dest != nullptr);
	assert(src != nullptr);
	while ((*dest++ = *src++) != '\0')
	{
		;
	}
	return ret;
}
char* Strcat(char *dest, const char* src)
{
	char *ret = dest;
	assert(dest != nullptr);
	assert(src != nullptr);
	while (*dest != '\0')
	{
		dest++;
	}
	while (*dest++ = *src++)
	{
		;
	}
	return ret;
}
int Strcmp(const char* s1, const char* s2)
{
	assert(s1 != nullptr);
	assert(s2 != nullptr);
	while ((*s1 != '\0' && *s2 != '\0') && *s1 == *s2)
	{
		s1++;
		s2++;
	}
	return *s1 - *s2;
}
//判断s2是否为s1的子串
char* Strstr(const char* s1, const char* s2)
{
	assert(nullptr != s1);
	assert(nullptr != s2);
	if ('\0' == *s2)
	{
		return (char *)s1;
	}
	while ('\0' != *s1)
	{
		const char* st1 = s1;
		const char* st2 = s2;
		while (('\0' != *st2) && (*st1 == *st2))
		{
			st1++;
			st2++;
		}
		if ('\0' == *st2)
		{
			return (char*)s1;
		}
		s1++;
	}
	return nullptr;
}
//字符串中找字符
char *Strchr(char const *s1, char ch)
{
	assert(s1 != 0);
	while (*s1 != '\0')
	{
		if (*s1 == ch)
		{
			return (char *)s1;
		}
		s1++;
	}
	return nullptr;
}
char *Strrchr(char const *s1, char ch)
{
	assert(s1 != nullptr);
	char *pos = 0;
	while (*s1 != '\0')
	{
		if (*s1 == ch)
		{
			pos = (char *)s1;
		}
		s1++;
	}
	if (pos != nullptr)
	{
		return pos;
	}
	else
	{
		return nullptr;
	}
}
void* Memcpy(void *dest, const void* src, size_t n)
{
	assert(dest != nullptr);
	assert(src != nullptr);
	char *d = (char *)dest;
	const char *s = (char *)src;
	while (n--)
	{
		*d++ = *s++;
	}
	return dest;
}
void* Mommove(void *dest, const void *src, size_t n)
{
	assert(dest != nullptr);
	assert(src != nullptr);
	char *d = (char*)dest;
	char *s = (char*)src;
	if (d < s || d > s + n)
	{
		while (n--)
		{
			*d++ = *s++;
		}
	}
	else
	{
		d = d + n - 1;
		s = s + n - 1;
		while (n--)
		{
			*d-- = *s--;
		}
	}
	return dest;
}

测试:

int main()
{
	char array[1024] = "abcdfccccsakk";
	char *q = "ssss";
	printf("%s\n", Strcpy(array, q));
	printf("%s\n", strcpy(array, q));
	printf("%s\n", Strcat(array, q));
	printf("%s\n", strcat(array, q));
	printf("%d\n", Strcmp(array, q));
	printf("%d\n", strcmp(array, q));
	printf("%s\n", Strstr(array, q));
	printf("%s\n", strstr(array, q));
	printf("%s\n", Strrchr(array, 'c'));
	printf("%s\n", strrchr(array, 'c'));
	printf("%s\n", memcpy(array, q, 3));
	printf("%s\n", Memcpy(array, q, 3));
	printf("%s\n", Mommove(array, q, 3));
	printf("%s\n", memmove(array, q, 3));
	return 0;
}

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值