inputres.cpp

来自「Stack, queue, sorting exmaples in C/C++.」· C++ 代码 · 共 87 行

#include<iostream.h>
#include<stdio.h>
#include<conio.h>

struct deque{
 int rear,front;
 int item[10];
 };

void rear(struct deque *p)
{        int i,x;
 if(p->rear==5)
 { printf("full\n");
  for(i=0;i<5;i++)
  {
    printf("%d\t",p->item[i]);
    }
 }
 else
 {
  printf("enter the nos\n");
  scanf("%d",&x);
  p->item[p->rear]=x;
  printf("%d has been added\n",x);
  p->rear++;
  }
}

void delrear(struct deque *p)
{      int x;
 if(p->rear==p->front)
 {
  printf("empty\n");
  }
  else
  {
   p->rear--;
   x=p->item[p->rear];
   printf("%d has been poped\n",x);

   }
}

void delfront(struct deque *p)
{
 int i,x;
 if(p->front==p->rear)
 {
  printf("empty\n");
  }
  else
  {
   x=p->item[p->front];
   printf("%d has been poped\n",x);
   p->front++;
   }
}

void main()
{
 struct deque *w;
 int x;
 w->front=w->rear=0;

 printf("enter the term 1 in 2 delfro 3 delrear 4 ter");
 scanf("%d",&x);

 while(x!=4)
 {
  switch(x)
  {
   case 1:
   rear(w);
   break;

   case 2:
   delfront(w);
   break;

   case 3:
   delrear(w);
   break;
  }
  scanf("%d",&x);
  }
}