求一串字符的长度(循环)
int jishu(char* x)
{
int i = 0;
while (*x != '\0')
{
i++;
x++;
}
return i;
}
#include <stdio.h>
int main()
{
char arr[] = "nb";
printf("%d", jishu(arr));
return 0;
}
求一串字符的长度(递归)
int jishu(char* x)
{
if (*x != '\0')
{
return 1 + jishu(x + 1);
}
else
{
return 0;
}
}
#include <stdio.h>
int main()
{
char arr[] = "nb";
printf("%d", jishu(arr));
return 0;
}
求n的阶乘(递归)
#define _CRT_SECURE_NO_WARNINGS
int jiecheng(int x)
{
if (1 <= x)
{
return x * jiecheng(x - 1);
}
else
{
return 1;
}
}
#include <stdio.h>
int main()
{
int n;
scanf("%d", &n);
printf("%d", jiecheng(n));
return 0;
}
求斐波那契数列第n项(循环)
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main()
{
int a = 1, b = 1, c = 0;
int i, n;
scanf("%d", &n);
if (n == 1 || n == 2)
c = 1;
else
{
for (i = 3; i <= n; i++)
{
c = a + b;
a = b;
b = c;
}
}
printf("%d", c);
return 0;
}