一些库函数的实现


本篇梗概

一些库函数的实现

1.memmove

void* my_memmove(void* dest, const void* src, size_t count)
{
	assert(dest != NULL && src != NULL);
	char* pdest = (char*)dest;
	char* psrc = (char*)src;
	if (psrc >= pdest || pdest >= psrc + count)
	{
		while (count-- != 0)
		{
			*pdest++ = *psrc++;
		}
	}
	else
	{
		pdest = pdest + count - 1;
		psrc = psrc + count - 1;
		while (count-- != 0)
		{
			*pdest-- = *psrc--;
		}
	}
	return dest;
}
 
int main()
{
	char str1[50] = "aasdfdgdsgbfhjjjkghlkg";
	my_memmove(str1+4, str1 , 6);
	printf("%s", str1);
	system("pause");
	return 0;
}

2.memcpy

void* my_memcpy(void* dest, const void* src, size_t count)
{
	assert(dest != NULL && src != NULL);
	char* pdest = (char*)dest;
	char* psrc = (char*)src;
 
	while (count-- != 0)
	{
		*pdest++ = *psrc++;
	}
	
 
	return dest;
}
 
int main()
{
	char str1[50] = "aasdfdgdsgbfhjjjkghlkg";
	char*ret=my_memcpy(str1+4, str1 , 6);
	printf("%s", ret);
	system("pause");
	return 0;
}

3.strstr

int my_strstr(const char* string, const char* strCharSet)
{
	assert(string != NULL && strCharSet != NULL);
	const char* s = string;     
	const char* t = strCharSet; 
 
	int i, j;
	i = j = 0;
	while (s[i] != '\0' && t[j] != '\0')
	{
		if (s[i] == t[j])
		{
			i++;
			j++;
		}
		else
		{
			i = i - j + 1; 
			j = 0;
		}
	}
	if (t[j] == '\0')
		return i - j;
	return -1;
}
 
void main()
{
	char* str = "abababcabababc";
	char* t = "abcb";
 
	int index = my_strstr(str, t);
	if (index == -1)
		printf("不存在.\n");
	else
		printf("%d\n", index);
	system("pause");
	return 0;
 
}

4.strcat

char* my_strcat(char* strDest, const char* strSrc)
{
	assert(strDest != NULL && strSrc != NULL);
	char* ptmpDest = strDest;
	const char* ptmpSrc = strSrc;
	while (*ptmpDest != '\0')
		ptmpDest++;
 
	while (*ptmpSrc != '\0')
	{
		*ptmpDest++ = *ptmpSrc++;
	}
	*ptmpDest = '\0';
	return strDest;
}
 
void main()
{
	char str[50] = "abababcabababc";
	char* t = "ABCD";
	char*ret = my_strcat(str, t);
	printf("%s", ret);
	system("pause");
	return 0;
}

5.strcmp

int my_strcmp(const char* string1, const char* string2)
{
	assert(string1 != NULL && string2 != NULL);
	int ret;
	while (*string1 != '\0' || *string2 != '\0')
	{
		ret = *string1 - *string2;
		if (ret != 0)
			break;
		string1++;
		string2++;
	}
	return ret;
}
void main()
{
	char str1[50] = "abababcabababc";
	char* str2 = "ABCD";
	int wet = my_strcmp(str1, str2);
	if (wet > 0)
		printf("str1>str2");
	else if (wet < 0)
		printf("str1<str2");
	else if (wet == 0)
		printf("str1=str2");
	system("pause");
	return 0;
}

6.strcpy

char* my_strcpy(char* dest, const char* str)
{
 
	assert(dest != NULL && str != NULL);
 
	char* pdest = dest;
	const char* pstr = str;
	while (*pstr != '\0')
	{
		*pdest++ = *pstr++;
 
	}
	*pdest = '\0';
	return dest;
}
void main()
{
	char str1[50] = "abababcabababc";
	char* str2 = "ABCD";
	char *wet = my_strcpy(str1, str2);
	printf("%s", wet);
	system("pause");
	return 0;
}

7.strlen

int my_strlen(const char* str)
{
	int count = 0;
	while (*str)
	{
		count++;
		str++;
	}
	return count;
}
int main()
{
	char* p = "abcdef";
	int len = my_strlen(p);
	printf("%d\n", len);
	system("pause");
	return 0;
}
  • 3
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 3
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值