练习题(4)

char* strcpy(char* dest,const char* src)
{
	assert(dest != NULL && src != NULL);
	const char * p = src;
	while (*src != '\0')
	{
		*dest = *p;
		p++;
		if (*dest == 'a' || *dest == 'e' || *dest == 'i' || *dest == 'o' || *dest == 'u')
		{
			dest++;
		}
	}
	*dest = '\0';
	return dest;
}

int main()
{
	char stra[20] = { "adsslibee" };
	char strb[20] = {};
	strcpy(strb, stra);
	for (int i = 0; strb[i] != '\0'; i++)
	{
		printf("%c", strb[i]);
	}
	return 0;
}


char* MaxWords(const char* str)
{
	assert(str != NULL);
	int len = strlen(str);
	char* curword = (char*)malloc(sizeof(char) * (len + 1));//存放\0
	char* maxword = (char*)malloc(sizeof(char) * (len + 1));
	int cur = 0;
	int max = 0;
	while (*str != '\0')
	{
		if (isalpha(*str))
		{
			curword[cur++] = *str;
		}
		else
		{
			if (cur > max)
			{
				curword[cur] = '\0';
				strcpy_s(maxword, cur + 1, curword);
				max = cur;
				cur = 0;
			}
		}
		str++;
	}
	if (cur > max)
	{
		curword[cur] = '\0';
		strcpy_s(maxword, cur + 1, curword);
	}
	free(curword);
	return maxword;
}

void Bubblesort(int ar[], int len)
{
	assert(ar != NULL);
	for (int i = 0; i < len - 1; i++)
	{
		for (int j = 0; j+1 < len - i; j++)
		{
			int tmp = ar[j];
			ar[j] = ar[j + 1];
			ar[j + 1] = tmp;
		}
	}
}


int Lengeder(int n, int x)
{
	assert(n >= 0);
	if (n == 0)
	{
		return 1;
	}
	else if (n == 1)
	{
		return x;
	}
	else
	{
		((2 * n - 1) * x - Lengeder(n - 1, x) - (n - 1) * Lengeder(n - 2, x)) / n;
	}
}



void Move(int arr[], int n, int m)
{
	int* brr = (int*)malloc(sizeof(int) * m);
	if (brr == NULL)exit(1);
	for (int i = 0; i < m; i++)//把后m个数拷贝出来
	{
		brr[i] = arr[n - m+i];
	}
	for (int j = n - m - 1; j >= 0; j--)
	{
		arr[j + m] = arr[j];
	}
	for (int i = 0; i < m; i++)
	{
		brr[i] = arr[i];
	}
}