函数实现斐波那契数列
#include<stdio.h>
int feibo(int n)
{
if(n==0)
{
return 0;
}else if(n==1)
{
return n=1;
}else
{
return feibo(n-1)+feibo(n-2);
}
}
int main(int argc, char const *argv[])
{
int len=0;
printf("请输入要生成斐波那契数列的项数:");
scanf("%d",&len);
for(int i=0;i<len;i++)
{
printf("%d ",feibo(i));
}
printf("\n");
return 0;
}
二维数组的最大值
#include<stdio.h>
int main(int argc, char const *argv[])
{
int arr[3][3]={{3,5,8},{5,2,9},{3,7,4}};
int max=arr[0][0];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(arr[i][j]>max)
{
max=arr[i][j];
}
}
}
printf("最大值为%d\n",max);
return 0;
}
strcat函数的封装
char *my_strcat(char *dest, const char *src)
#include<stdio.h>
char *my_strcat(char *dest, const char *src)
{
char *p = dest;
char *q = src;
while (*p != '\0')
{
p++;
}
while (*q != '\0')
{
*p = *q;
p++;
q++;
}
*p = '\0';
return dest;
}