본문내용
>1)
{
que * p = out_que;
out_que = out_que->l_Next;
out_que->r_Next=0;
free(p);
Counts--;
}
else if(Counts==1)
{
free(out_que);
out_que=0;
in_que=0;
Counts--;
}
}
void Print()
{
que * p=in_que;
while(p)
{
printf("%d -> ",p->Data);
p = p->r_Next;
}
printf("\ncount=%d ",Counts);
}
int main()
{
int x;
while(1)
{
printf("삽입할 숫자를 입력하세요(음수를 입력하면 삭제됩니다.)\n");
scanf("%d",&x);
if(x>=0){
Push(x);
Print();
}
else if(x<0){
Pop();
Print();
}
}
}
#include
#include
typedef struct que
{
int Data;
struct que *r_Next;
struct que *l_Next;
} que;
int Counts=0;
que *in_que=0;
que *out_que=0;
void Push(int x)
{
que *p = in_que;
if(Counts==0)
{
in_que = (que *)malloc(sizeof(que));
out_que = in_que;
out_que->r_Next=0;
}
else
{
in_que = (que *)malloc(sizeof(que));
in_que->r_Next = p;
p->l_Next = in_que;
}
in_que->Data = x;
Counts++;
}
void Pop()
{
if(Counts>1)
{
que * p = out_que;
out_que = out_que->l_Next;
out_que->r_Next=0;
free(p);
Counts--;
}
else if(Counts==1)
{
free(out_que);
out_que=0;
in_que=0;
Counts--;
}
}
void Print()
{
que * p=in_que;
while(p)
{
printf("%d -> ",p->Data);
p = p->r_Next;
}
printf("\ncount=%d ",Counts);
}
void Clear_que(void)
{
que *p=in_que;
while(Counts)
{
p=in_que;
in_que=in_que->r_Next;
free(p);
Counts--;
}
}
int main()
{
int x;
char menu;
while(1)
{
printf("1.삽입 2.삭제 3.종료\n");
scanf("%c",&menu);
if(menu=='1'){
printf("삽입할 숫자를 입력하세요 : ");
scanf("%d",&x);
Push(x);
Print();
}
else if(menu=='2'){
Pop();
Print();
}
else if(menu=='3')
exit(1);
}
}
{
que * p = out_que;
out_que = out_que->l_Next;
out_que->r_Next=0;
free(p);
Counts--;
}
else if(Counts==1)
{
free(out_que);
out_que=0;
in_que=0;
Counts--;
}
}
void Print()
{
que * p=in_que;
while(p)
{
printf("%d -> ",p->Data);
p = p->r_Next;
}
printf("\ncount=%d ",Counts);
}
int main()
{
int x;
while(1)
{
printf("삽입할 숫자를 입력하세요(음수를 입력하면 삭제됩니다.)\n");
scanf("%d",&x);
if(x>=0){
Push(x);
Print();
}
else if(x<0){
Pop();
Print();
}
}
}
#include
#include
typedef struct que
{
int Data;
struct que *r_Next;
struct que *l_Next;
} que;
int Counts=0;
que *in_que=0;
que *out_que=0;
void Push(int x)
{
que *p = in_que;
if(Counts==0)
{
in_que = (que *)malloc(sizeof(que));
out_que = in_que;
out_que->r_Next=0;
}
else
{
in_que = (que *)malloc(sizeof(que));
in_que->r_Next = p;
p->l_Next = in_que;
}
in_que->Data = x;
Counts++;
}
void Pop()
{
if(Counts>1)
{
que * p = out_que;
out_que = out_que->l_Next;
out_que->r_Next=0;
free(p);
Counts--;
}
else if(Counts==1)
{
free(out_que);
out_que=0;
in_que=0;
Counts--;
}
}
void Print()
{
que * p=in_que;
while(p)
{
printf("%d -> ",p->Data);
p = p->r_Next;
}
printf("\ncount=%d ",Counts);
}
void Clear_que(void)
{
que *p=in_que;
while(Counts)
{
p=in_que;
in_que=in_que->r_Next;
free(p);
Counts--;
}
}
int main()
{
int x;
char menu;
while(1)
{
printf("1.삽입 2.삭제 3.종료\n");
scanf("%c",&menu);
if(menu=='1'){
printf("삽입할 숫자를 입력하세요 : ");
scanf("%d",&x);
Push(x);
Print();
}
else if(menu=='2'){
Pop();
Print();
}
else if(menu=='3')
exit(1);
}
}
소개글