递归的简单练习

递归打印一个整数每一位

#include<stdio.h>
void Print(int n)
{
	if (n < 10)
	{
		printf("%d ", n); 
	}
	else
	{
		Print(n / 10);
		printf("%d ", n % 10);
		
	}
}
int main()
{
	int n = 0;
	printf("input number:>");
	scanf_s("%d", &n);
	Print(n);
	return 0;
}

求阶乘

递归实现

#include<stdio.h>
int Fac(int n)
{
	if (n == 1)
		return 1;
	else
		return n * Fac(n - 1);
}
int main()
{
	int n;
	printf("input number:>");
	scanf_s("%d", &n);
	int ret = Fac(n);
	printf("%d", ret);
	return 0;
}

非递归实现

#include<stdio.h>
int Fac(int n)
{
	int ret = 1;
	int i = 0;
	for (i = n; i > 0; i--)
	{
		ret = ret * i;
	}
	return ret;
}
int main()
{
	int n;
	printf("input number:>");
	scanf_s("%d", &n);
	int ret = Fac(n);
	printf("%d", ret);
	return 0;
}

strlen模拟

(递归实现)

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
int my_strlen(const char* p)
{
	assert(p);
	if (*p == '\0')
		return 0; 
	else
		return 1 + my_strlen(p + 1);
}
int main()
{
	char arr[] = "abcd";
	int ret = my_strlen(arr);
	printf("%d", ret);
	return 0;
}

(计数器实现)

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
int my_strlen(const char* p)
{
	assert(p);
	int count = 0;
	while (*p != '\0')
	{
		count++;
		p++;
	}
	return count;
}
int main()
{
	const char arr[] = "abcdef";
	int ret = my_strlen(arr);
	printf("%d", ret);
	return 0;
}

(指针)

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
int my_strlen(const char* p)
{
	assert(p);
	const char* tmp = NULL;
	tmp = p;
	while (*tmp != '\0')
	{
		tmp++;
	}
	return tmp - p;
}
int main()
{
	char arr[] = "abcdef";
	int ret = my_strlen(arr);
	printf("%d", ret);
	return 0;
}

字符串逆序

(递归实现)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<assert.h>
void reverse_string(char* string)
{
	assert(string);
	if (*string == '\0')
		return;
	else
	{
		int len = strlen(string);
		char tmp = string[0];
		string[0] = string[len - 1];
		string[len - 1] = '\0';
		reverse_string(string + 1);
		string[len - 1] = tmp;
	}
}
int main()
{
	char arr[] = "abcdef";
	reverse_string(arr);
	printf("%s", arr);
}

（非递归）

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<assert.h>
void reverse_string(char* string)
{
	assert(string);
	int left = 0;
	int right = strlen(string) - 1;
	while (left < right)
	{
		char tmp = string[left];
		string[left] = string[right];
		string[right] = tmp;
		left++;
		right--;
	}
}
int main()
{
	char arr[] = "abcdef";
	reverse_string(arr);
	printf("%s", arr);
	return 0;
}

计算每位数之和

（递归实现）

#include<stdio.h>
int DigitSum(int n)
{
	if (n < 10)
		return n;
	else
		return DigitSum(n / 10) + n % 10;
}

int main()
{
	int n = 0;
	printf("input number:>");
	scanf_s("%d", &n);
	int ret = DigitSum(n);
	printf("%d", ret);
	return 0;
}

递归计算n的k次方

#include<stdio.h>
#include<stdlib.h>
int PowerFunc(int n, int k)
{
	if (k == 0)
		return 1;
	else if (k == 1)
		return n;
	else
		return n * PowerFunc(n, k - 1);
}
int main()
{
	int n = 0;
	int k = 0;
	printf("input number n and number k:>");
	scanf_s("%d%d", &n, &k);
	int ret = PowerFunc(n, k);
	printf("%d的%d次方=%d\n", n, k, ret);
	return 0;
}

计算第n个斐波那契数（递归）

#include<stdio.h>
int fib(int n)
{
	if (n == 0)
		return 0;
	else if (n == 1)
		return 1;
	else
		return fib(n - 1) + fib(n - 2);
}
int main()
{
	int n = 0;
	printf("input number:>");
	scanf_s("%d", &n);
	int ret = fib(n);
	printf("%d\n", ret);
	return 0;
}