作业4.7

1、用链栈10转2
01_main.c
#include <stdio.h>
#include"./03_b.h"
int main(int argc, const char argv[])
{
lsx=cj();
int y=0;
scanf(“%d”,&y);
printf(“%d\n”,y);
int i=0;
while(1){
if(1y%2){
yz(x,y%2);
y=y/2;
}else if(0y%2){
yz(x,y%2);
y=y/2;
}
if(0y||1y){
yz(x,y);
break;
}i++;
}
fz(x);
bl(x);
return 0;
}
02_a.c

#include <stdio.h>
#include<stdlib.h>
#include"./03_b.h"
//创建
ls* cj(){
ls* head=(ls*)malloc(sizeof(ls));//申请一个堆空间
if(NULL == head){
printf(“头结点申请失败，链表创建失败\n”);
return NULL;
}
//将头结点进行初始化
head->data.len=0;
head->next=NULL;
return head;
}
void yz(lshead,zx num){
lsa=(ls*)malloc(sizeof(ls));
if(NULL==a){
printf(“创建新结点失败，插入失败\n”);
return;
}
//将结点初始化
a->data.text=num;
a->next=NULL;
//找到尾结点
lsp=head;
while(p->next!=NULL){
p=p->next;
}
//尾插法插入数据
a->next=p->next;
p->next=a;
head->data.len++;
return;
}
void bl(ls head){
lsp=head;
while(p->next!=NULL){
//printf(“%d\t”,p->data.text);
p=p->next;
printf(“%d\t”,p->data.text);
}
printf(“\n”);
return;
}
void tz(lshead){
lsx=head->next;
lsy=head;
while(x->next!=NULL){
x=x->next;
y=y->next;
}
free(x);
y->next=NULL;
head->data.len–;
return;
}
void fz(lsa){
//备份第一个结点
lsx,y;
x=a->next;
//头结点独立出来
a->next=NULL;
//头插法插入链表中
while(x!=NULL){
y=x->next;
x->next=a->next;
a->next=x;
x=y;
}
return;
}
03_b.h
#ifndef C
#define C
typedef int zx;
typedef struct lsdl{
union{
zx text;
int len;
}data;
struct lsdl next;
}ls;

lscj();
void yz(ls,zx);
void bl(ls*);
void tz(ls*);
void fz(ls*);
#endif

2、链式队列

#include <stdio.h>
#include<stdlib.h>
#include"./02_lsdl.h"
//创建
lq_hr* cj(){
lq_hrq=(lq_hr)malloc(sizeof(lq_hr));
if(NULLq){
printf(“创建失败\n”);
return 0;
}
q->head=(ls*)malloc(sizeof(ls));
if(NULLq->head){
printf(“创建失败\n”);
free(q);
return 0;
}
q->head->next=NULL;
q->head->data.len=0;
q->rear=q->head;

return q;

}
//（入队）头插
void tc(lq_hra,zx b){
lq_hry=a;
lsx=(ls)malloc(sizeof(ls));
if(NULLx){
printf(“创建失败”);
return;
}
x->data.text=b;
x->next=y->head->next;
y->head->next=x;
y->rear=x;
y->head->data.len++;
return;
}
//判空
zx pk(lq_hr*a){
if(a->heada->rear){
printf(“为空”);
return 1;
}return 0;
}
//(出队)头删
void ts(lq_hra){
lsx=a->head;
lq_hrz=a;
if(pk(z)){
return;
}
lsy=x->next;
x->next=y->next;
x->data.len–;
free(y);
if(x->nextNULL){
a->rear=a->head;
}
}
//(入队)尾插
void wc(lq_hra,zx b){
lsx;
lq_hry=a;
x=(ls)malloc(sizeof(ls));
if(NULLx){
printf(“创建失败”);
return;
}
x->next=NULL;
x->data.text=b;
y->rear->next=x;
y->rear=x;
y->head->data.len++;
return;
}
//(出队)尾删
void ws(lq_hra){
lq_hrx=a;
if(pk(x)){
printf(“空链队列”);
return;
}
lsy=a->head;
while(y->next->next!=NULL){
y=y->next;
}
free(y->next);
y->next=NULL;
a->rear=y;
return;
}
//遍历
void bl(lq_hra){
ls*x=a->head->next;
while(x!=NULL){
printf(“%d “,x->data.text);
x=x->next;
}
printf(”\n”);
return;
}