C语言--左旋字符/右旋字符实现及其判断

void leftmove(char* str, int k)
{
	int j = 0;
	assert(str);
	for (j = 0; j < k; j++)
	{
		char temp = *str;
		int len = strlen(str);
		int i = 0;
		for (i = 0; i < len - 1; i++)
		{
			*(str + i) = *(str + i + 1);
		}
		*(str + len - 1) = temp;
	}
}
int main()
{
	char arr[] = "abcdefgh";
	int k = 0;
	scanf("%d", &k);
	leftmove(arr, k);
	printf("%s\n", arr); 
	return 0;
}

//这个优化了刚才的算法，因为刚才的算法可能让某一些元素
 //进行多次的移动，降低了代码的执行效率
void reverse(char* left, char* right)
{
	while (left < right)
	{
		char temp = *left;
		*left = *right;
		*right = temp;
		left++;
		right--;
	}
}
void leftmove(char* str, int k)
{
	int len = strlen(str);
	//左边逆序
	reverse(str, str + k - 1);
	//右边逆序
	reverse(str + k, str + len - 1);
	//整体逆序
	reverse(str, str + len - 1);
}
int main()
{
	char arr[] = "abcdefgh";
	int k = 0;
	scanf("%d", &k);
	leftmove(arr, k);
	printf("%s\n", arr); 
	return 0;
}

int isleftmove(char* str1, char* str2)
{
	int j = 0;
	assert(str1 && str2);
	int len = strlen(str1);
	for (j = 0; j < len; j++)
	{
		char temp = *str1;
		int i = 0;
		for (i = 0; i < len - 1; i++)
		{
			*(str1 + i) = *(str1 + i + 1);
		}
		*(str1 + len - 1) = temp;
		if (strcmp(str1, str2) == 0)
			return 1;
	}
	return 0;
}
int main()
{
	char arr1[] = "abcdefgh";
	char arr2[] = "efghabcd";
	int ret = isleftmove(arr1, arr2);
	if (ret == 1)
	{
		printf("yes\n");
	}
	else
	{
		printf("not\n");
	}
	return 0;
}

int isleftmove(char* str1, char* str2)
{
	int len1 = strlen(str1);
	int len2 = strlen(str2);
	if (len1 != len2)
	{
		return 0;
	}
	strncat(str1, str1, len1);
	if ((strstr(str1, str2) == NULL))
		return 0;
	else
		return 1;
}
int main()
{
	char arr1[30] = "abcdefgh";
	//放两次，就可以找到所有的符合条件的结果
	char arr2[] = "efghabcd";
	int ret = isleftmove(arr1, arr2);
	if (ret == 1)
	{
		printf("yes\n");
	}
	else
	{
		printf("not\n");
	}
	return 0;
}