資料結構-佇列操作
阿新 • • 發佈:2019-01-09
#include<stdio.h>
#include<malloc.h>
#define N 10
typedef int datatype;
typedef struct
{
datatype data[N];
int front,rear;
}sequeue;
sequeue *create_empty_sequeue()
{
sequeue *s = NULL;
s = (sequeue *)malloc(sizeof(sequeue));
s->front = s->rear = 0;
return s;
}
int empty_sequeue( sequeue *s )
{
if( s->rear == s->front )
return 1;
else
return 0;
}
int full_sequeue( sequeue *s )
{
if((S->rear+1)%N == s->front)
return 1;
else
return 0;
//return (s->rear+1) == s->front;
}
int en_sequeue(sequeue *s,datatype x)
{
if(full_sequeue(s))
{
return 0;
}
else
{
s-rear = (s->rear+1)%N;
s->data[s->rear] = x;
return 1;
}
}
datatype de_sequeue(sequeue *s)
{
s->front = (s->front + 1)%N;
return s->data[s->front];
}
int clear_squeue(sequeue *s)
{
if(empty_sequeue(s))
{
return 0;
}
else
{
s->front = s->rear = 0;
return 1;
}
}
int main (int argc , char *argv[])
{
sequeue sq = NULL;
sq = create_empty_sequeue();
return 0;
i
}
#include<malloc.h>
#define N 10
typedef int datatype;
typedef struct
{
datatype data[N];
int front,rear;
}sequeue;
sequeue *create_empty_sequeue()
{
sequeue *s = NULL;
s = (sequeue *)malloc(sizeof(sequeue));
s->front = s->rear = 0;
return s;
}
int empty_sequeue( sequeue *s )
{
if( s->rear == s->front )
return 1;
else
return 0;
}
int full_sequeue( sequeue *s )
{
if((S->rear+1)%N == s->front)
return 1;
else
return 0;
//return (s->rear+1) == s->front;
}
int en_sequeue(sequeue *s,datatype x)
{
if(full_sequeue(s))
{
return 0;
}
else
{
s-rear = (s->rear+1)%N;
s->data[s->rear] = x;
return 1;
}
}
datatype de_sequeue(sequeue *s)
{
s->front = (s->front + 1)%N;
return s->data[s->front];
}
int clear_squeue(sequeue *s)
{
if(empty_sequeue(s))
{
return 0;
}
else
{
s->front = s->rear = 0;
return 1;
}
}
int main (int argc , char *argv[])
{
sequeue sq = NULL;
sq = create_empty_sequeue();
return 0;
i
}