内存函数及内存函数的操作

#define _CRT_SECURE_NO_WARNINGS 1
#include<assert.h>
#include <string.h>
#include <stdio.h>
#include<limits.h>
#include<errno.h>
#include<stdlib.h>
int main()
{
	char arr[] = "zpengwei@yeah.net.hehe@haha nihao";
	char buf[50] = { 0 };//zpengwei@yeah.net.hehe@haha nihao
	strcpy(buf, arr);

	const char* sep = "@. ";
	char* str = NULL;
	for (str=strtok(buf, sep); str!=NULL; str=strtok(NULL, sep))
	{
		printf("%s\n", str);
	}
	//strtok
	//"@."
	//printf("%s\n", strtok(buf, sep));//只找第一个标记
	//printf("%s\n", strtok(NULL, sep));//是从保存的好的位置开始继续往后找
	//printf("%s\n", strtok(NULL, sep));//是从保存的好的位置开始继续往后找
	return 0;
}
int main()
{
	//	//printf("%s\n", strerror(0));
	//	//printf("%s\n", strerror(1));
	//	//printf("%s\n", strerror(2));
	//	//printf("%s\n", strerror(3));
	int* p = (int*)malloc(INT_MAX);//想堆区申请内存的
	if (p == NULL)
	{
		//printf("%s\n", strerror(errno));//错误嘛转换成错误信息，打印错误信息的起始地址
		perror("Malloc");//打印错误信息
		return 1;
	}
	//	//....
	//
	return 0;
	//
}
int main()
{
	char ch = 'A';
	putchar(toupper(ch));//转大写
	putchar(tolower(ch));//转小写

	return 0;
}
void* my_memcpy(void* dest, void* src, size_t count)
{
	assert(dest && src);
	void* ret = dest;
	while (count--)
	{
		*(char*)dest = *(char*)src;
		dest = (char*)dest+1;
		src = (char*)src+1;
	}
	return ret;
}
int main()
{
	int arr1[10] = { 1,2,3,4,5,6,7,8,9,10 };
	int arr2[5] = { 0 };
	my_memcpy(arr2, arr1, 20);
	return 0;
}
void* my_memmove(void* dest, const void*src, size_t count)
{
	assert(dest && src);
	void* ret = dest;
	if (dest < src)
	{
		//前->后
		while (count--)
		{
			*(char*)dest = *(char*)(src);
			dest = (char*)dest + 1;
			src = (char*)src + 1;
		}
	}
	else
	{
		//后->前
		while (count--)
		{
			*((char*)dest+count) = *((char*)src + count);
		}
	}

	return ret;
//}
int main()
{
	int arr[] = { 0x11111111,0x22222222,3,4,5 };
	memset(arr, 6, 20);//memset是以字节为单位来初始化内存单元的

	return 0;
}

#define _CRT_SECURE_NO_WARNINGS 1
#include<assert.h>
#include <string.h>
#include <stdio.h>

int main()
{
	//char ch = 'a';
	//"abcdef";//C语言没有字符串类型
	//char arr[] = "abcdef";
	//char arr[10] = { 'a', 'b', 'c', 'd', 'e', 'f'};
	//char arr[] = { 'a', 'b', 'c', 'd', 'e', 'f' };
	//int len = strlen(arr);//string length
	//printf("%d\n", len);

	//if ((int)strlen("abc") - (int)strlen("qwerty") > 0)
	//{
	//	printf(">\n");
	//}
	//else
	//{
	//	printf("<=\n");
	//}

	char arr[] = "abcdef";
	int len = my_strlen(arr);
	printf("%d\n", len);

	return 0;
 //1. 计数器的方法
size_t my_strlen(const char* str)
{
	int count = 0;
	assert(str != NULL);
	while (*str != '\0')
	{
		count++;
		str++;
	}
	return count;
}
}
char* my_strcpy(char* dest,const char* src)
{
	assert(dest&& src);
	char* ret = dest;
	while (*dest++ = *src++);//即作为参数右将其返回，还巧妙解决无法将\0拷贝的问题
	return ret;
}
int main()
{
	char arr1[20] = { 0 };
	char* arr2 = "hello bit";
	printf("%s\n", my_strcpy(arr1, arr2));//strcpy设计返回指针可以链式访问
	return 0;
}
int main()
{
	char arr1[20] = "hello";
	char arr2[] = " bit";

	printf("%s\n", my_strcat(arr1, arr2));
	
	return 0;
}
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[] = "bit";
	printf("%s\n",my_strcat(arr1, arr2));
	return 0;
//}
 三种方式实现strlen
方法1：
int my_strlen(char* str)
{
	assert(str);
	int len = 0;
	while (*str)
	{
		len++;
		str++;
	}
	return len;
}
int main()
{
	char arr[] = "abcde";
	printf("%d\n",my_strlen(arr));
	return 0;
}
方法2：
递归调用：
int my_strlen(char* arr)
{
	if (*arr)
		return 1 + my_strlen(arr + 1);
	else
		return 0;

}
int main()
{
	char arr[] = "abcdef";
	int ret=my_strlen(arr);
	printf("%d\n", ret);
	return 0;
}
int my_strlen(char* arr)
{
	char* left = arr;
	char* right = arr;
	while (*right)
	{
		right++;
	}
	return right - left;
}
int main()
{
	char arr[] = "abcdef";
	int ret=my_strlen(arr);
	printf("%d\n", ret);
	return 0;
}
int my_strcmp(const char* s1, const char*s2)
{
	assert(s1 && s2);
	while (*s1 == *s2)
	{
		if (*s1 == '\0')//一定要判断是否为\0
		{
			return 0;
		}
		s1++;
		s2++;
	}
	if (*s1 > *s2)
		return 1;
	else
		return -1;
}
int main()
{
	char arr1[] = "abc";
	char arr2[] = "abc";
	int ret=my_strcmp(arr1,arr2);
	if (ret > 0)
		printf(">");
	else if (ret == 0)
		printf("=");
	else
		printf("<");
	return 0;
}
指针-指针
int my_strcmp(const char* s1, const char* s2)
{
	assert(s1 && s2);
	while (*s1 == *s2)
	{
		if (*s1 == '\0')//一定要判断是否为\0
		{
			return 0;
		}
		s1++;
		s2++;
	}
	return *s1 - *s2;//不相等
}
int main()
{
	char arr1[] = "abc";
	char arr2[] = "abc";
	int ret=my_strcmp(arr1,arr2);
	if (ret > 0)
		printf(">");
	else if (ret == 0)
		printf("=");
	else
		printf("<");
	return 0;
}
缺陷：
int main()
{
	char arr1[] = "abc";
	char arr2[] = "abcedfg";
}
解决方案：

int main()
{
	char arr1[] = "abcdef";
	char arr2[] = "qwe";

	strncpy(arr1, arr2, 5);

	printf("%s\n", arr1);
	return 0;
}


int main()
{
	char arr1[20] = "abcdef\0XXXXXXXX";
	char arr2[] = "qwe";
	strncat(arr1, arr1, 5);
	printf("%s\n", arr1);

	return 0;
}

int main()
{
	char arr1[] = "abcdef";
	char arr2[] = "abcdq";
	int ret = strncmp(arr1, arr2, 4);
	
	printf("%d\n", ret);

	return 0;
}


int main()
{
	char arr1[] = "abcdef";
	char arr2[] = "abc";
	if (arr1 < arr2)
	{

	}
	char* p = "abc";

	if ("abc" < "abcdef")
	{

	}
	return 0;
}


int main()
{
	char arr1[] = "abcdefcdef";
	char arr2[] = "cdef";
	char* ret = strstr(arr1, arr2);
	if (NULL == ret)
	{
		printf("找不到字串\n");
	}
	else {
		printf("%s\n", ret);
	}
	return 0;
}
char* my_strstr(const char* str1, const char* str2)
{
	assert(str1 && str2);

	const char* s1 = str1;
	const char* s2 = str2;

	const char* cur = str1;
	while (*cur)
	{
		s1 = cur;
		s2 = str2;

		while (*s1 && *s2 && (*s1 == *s2))
		{
			s1++;
			s2++;
		}
		if (*s2 == '\0')
		{
			return (char*)cur;
		}
		cur++;
	}

	return NULL;//找不到
}


查找子串的时候
KMP算法 - B站：比特大博哥


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

	char cur = str1;
	while ((*str1) && (*str2) && (str1 == str2))
	{
		str1++;
		str2++;
	}
	if (*str2 == '\0')
	{
		return (char*)cur;
	}
	cur++;
	return NULL;

}
int main()
{
	char arr1[] = "abcdef";
	char arr2[] = "bcd";
	char* ret=strstr(arr1, arr2);
	if (ret == NULL)
		printf("找不到子串\n");
	else
	

	printf("%s\n", ret);
	return 0;
}