动态顺序表

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
typedef int Datatype;
#define SIZE__ 10
typedef struct deqlist
{
Datatype *array;
int size;
int capacity;
}Deqlist;
void printdeqlist(Deqlist*L)
{
assert(L);
int i = 0;
for (i = 0; i < L->size; i++)
{
printf("  %d", L->array[i]);
}
printf("\n");
}


void initdeqlist(Deqlist *L)
{
assert(L);
L->array = (Datatype *)malloc(SIZE__*sizeof(Datatype));
L->size = 0;
L->capacity = SIZE__;
}
void explanddeqlist(Deqlist *L)
{
assert(L);
if (L->size >= L ->capacity)
{
L->capacity = L->capacity * 2;
Datatype *newarray = (Datatype*)malloc(L->capacity*sizeof(Datatype));
memcpy(newarray, L->array, L->size*sizeof(Datatype));
L->array = newarray;
}
}
void pushback(Deqlist *L, Datatype data)
{
assert(L);
explanddeqlist(L);
L->array[L->size++] = data;
}
void popback(Deqlist *L)
{
assert(L);
if (L->size > 0)
{
L->size--;
}
}
void pushfront(Deqlist *L,Datatype data)
{
assert(L);
explanddeqlist(L);
int i = 0;
for (i = L->size; i <= 0; i--)
{
L->array[i] = L->array[i - 1];
}
L->array[0] = data;
L->size++;
}
void popfront(Deqlist *L)
{
assert(L);
int i = 0;
for (i = 1; i < L->size; i++)
{
L->array[i-1] = L->array[i];
}
L->size--;
}


int main()
{
Deqlist L;
initdeqlist(&L);
pushback(&L, 5);
pushback(&L, 1);
pushback(&L, 2);
pushback(&L, 3);
pushback(&L, 4);
popback(&L);
pushfront(&L, 10);
popfront(&L);
printdeqlist(&L);
system("pause");
return 0;
}