计算机教程
};
while(p1!=NULL) {printf(“%7s %7s\n”,p1->num,p1->name); p1=p1->next; } } 11.11建立一个链表,每个结点包括:学号、姓名、性别、年龄。输入一个年龄,如果链表 中的结点所包含的年龄等于此年龄,则将此结点删去。 解:#define NULL 0 #define LEN sizeof(struct student) struct student {char num[6]; char name[8]; char sex[2]; int age; stuct student *next; }stu[10]; main() {struct student *p,*pt,*head; int I,length,iage,flag=1; int find=0; while(flag==1) {printf(“input length of list(<10):”); scanf(“%d”,&length); if(length<10) flag=0; } for(I=0;I<lenth;I++) {p=(struct student *)malloc(LEN); if(I==0) head=pt=p; else pt->next=p; pt=p; ptintf(“NO:”); scanf(“%s”,p->num); prntf(“name:”); scanf(“%s”,p->name); printf(“sex:”); scanf(“%s”,p->sex); printf(“age:”); scanf(“%s”,p->age); } p->next=NULL; p=head; printf(“\n NO. name sex age\n”); while(p!=NULL) {printf(“%4s%8s%6s%6d\n”,p->num, p->name, p->sex, p->age); p=p->next; } printf(“Input age:”); scanf(“%d”,&iage); pt=head; p=pt; if(pt->age==iage) {p=pt->next; head=pt=p; find=1;
} else pt=pt->next; while(pt!=NULL) {if(pt->age==iage) {p->next=pt->next; find=1; } else p=pt; pt=pt->next; } if(!find) printf(“Not found%d.”,iage); p=head; printf(“\n NO.name sex age\n”); while(p!=NULL) { printf(“%4s%8s”,p->num,p->name); printf(“%6s%6d”,p->sex,p->age); p=p->next; } } 11.12将一个链表按逆序排列,即将链头当链尾,链尾当链头。 解: # define NULL 0 struct stu {int num; struct stu *next; } main() {int len=1l struct stu *p1,*p2,*head,*new,*newhead; p1=p2=head=(struct stu * )malloc(sizeof(strct stu)); printf(“input number(0:list end):”); scanf(“%d”,&p1->num); while(p1->num!=o) {p1=(struct stu*)malloc(sizeof(struct stu)); printf(“input number(n:listend):”); scanf(“%d”,&p1->num); if(p1->num==0) p2->next=null; else {p2=>next=p1; p2=p1; len++; } } p1=head; pritnf(“\n the original list:\n”); do {printf(“%4d”,p1->num); if(p1->next!=NULL) p1=p1->next; } while(p1->next!=NULL) {p2=p1; p1=p1->next;
} if(I==0) newhead=new=p1; else new=nes->next=p1; p2->next=NULL; } printf(\n\n The new listL\n); p1=newhead; for(I=0l;I<len;I++) {pritf(“4d,p1->num”); p1=p1->next, } printf(“\n”); } 第12章 12.1编写一个函数getbits,从一个16位的 单元中取出某几位(即该几位保留原值,其余 位为0)。函数调用形式为:getbits(value,n1,n2)其中value为该16位单元中的数据值,n1为 欲取出的起始位,n2为欲取出的结束位。 解:main() {unsingned int a; int n1,n2; printf(“input an octal number:”); scanf(“%o”,&a); printf(“input n1,n2:”); scanf(“%d,%d”,&n1,&n2); printf(“result:%o\n”,getbits(a,n1-1,n2)); } getbits(unsigned value,int n1,n2) {unsigned int z; z= ̄0; z=(z>>n1)&(z<<(16-n2); return(z);; } 12.2写一个函数,对一个16位的二进制数驱除它的奇数位。 解:main() {unsigned getbits(unsigned); unsigne int a; printf(“\ninput an octal number:”); scanf(“%o”,&a); printf(“result:%o\n”,,getbits(a)); } unsigner getbits(unsigned value) {int I,j,m,n; unsigned int z,a q; z=0; for(I=1;I<=15;I+=2) {q=1; for(j=1;j<=(16-I-1)/2;j++) q=q*2; a=value>>(16-i); a=a<<15; a=a>>15; z=z+a*q; } return(z); }
12.3编一程序,检查一下年一所用的计算机系统的C编译在执行有移时是按照逻辑位移的 原则,还有按照算术右移的原则。如果是逻辑右移,请编一函数实现算术右移。如果是算 术右移,请编写一函数实现逻辑右移。 解: main() {int a,n,m; a= ̄0; if(a>>5)!=a {printf(“\nTurbo C,logical move!\n”); m=0; } else {printf(“\nTurbo C,arithmetic move!\n”); m=1; } printf(“input an octal number:”); scanf(“%o”,&a); printf(“how mang digit move thwards the right ::”); scanf(“%d”,&n); if(m==0) printf(“Arithmetic right move,result:%o\n”,getbits1(a,n)); else printf(“Logical ritht move,result:%o”, getbits2(a,