运用递归的方法,初始置为0,遇到0变1,遇到1在前面插入一个0
Eg:a=1,1;
a=2,01;
a=3,101;
a=4,01101;
a=5,10101101;
#include<stdio.h>
#include<windows.h>
void bianhuan(int a)
{
if(a == 0)
printf(“0”);
else if(a == 1)
printf(“1”);
else if(a == 2)
printf(“01”);
else
{
bianhuan(a-2);
bianhuan(a-3);
bianhuan(a-2);
}
}
void main()
{
printf(“请输入一个数”);
int a;
scanf("%d",&a);
bianhuan(a);
system(“pause”);
}
运行结果: