sqlist2.cpp

数据结构经典课件(附带各章的经典算法) 具体代码是使用C语言编写的

#include <cstdlib>
#define  MaxSize 10
typedef  int  ElemType;
typedef struct
{
   int  length;
   ElemType data[MaxSize+1];   
}SqList;


void CreateList(SqList *&L,ElemType a[],int n)
{
  int  i;
  for(i=1;i<=n;i++)
	    L->data[i]=a[i];
  L->length=n;
}
void InitList(SqList *&L)
{
  L=(SqList *)malloc(sizeof(SqList));
  L->length =0;
}

int ListLength(SqList *L)
{
  int n;
  n=L->length ;
	return n;
}
bool GetElem(SqList *L,int i,ElemType &e)
{
   if(i<1 || i>L->length )
     return false;
   e=L->data[i];
   return true;
  
}
int LocatElem(SqList *L,ElemType e)
{
    int i=1;
	while(i<=L->length && L->data[i]!=e)
		i++;
	if(i<=L->length)
	  return i;
	else
	  return -1;
}
bool ListInsert(SqList *&L,int i,ElemType e)
{
  if(i<1 || i>L->length+1 || L->length==MaxSize)
	  return false;
  int j;
  for(j=L->length ;j>=i;j--)
	  L->data[j+1]=L->data[j];
  L->data[i]=e;
  L->length ++;
  return true;
}
bool ListDelete(SqList *&L,int i,ElemType &e)
{ if(i<1 || i>L->length )
    return false;
  int j;
  for(j=i+1;j<=L->length ;j++)
    L->data[j-1]=L->data[j];
  L->length --;
  return true;
}
void ex(SqList *&L,ElemType e1,ElemType e2,SqList *&L1)
{
  L1=(SqList *)malloc(sizeof(SqList));
  L1->length =0;
  int i,j;
  i=1;
  while(L->data[i]<e1)
	  i++;
  j=i;
  while(L->data[j]<=e2)
	  j++;
  int k1,k2;
  k1=i;k2=1;
  while(k1<j)
  {L1->data[k2]=L->data[k1];
   k1++;k2++;
   L1->length++;
  }
  while(j<=L->length)
  {L->data[i] =L->data[j] ;
   i++;j++;
  }
  L->length =L->length -L1->length ;
}
void main()
{
  SqList *L,*L1;
  ElemType a[]={0,11,22,33,44,55,66,77},e;
  InitList(L);
  CreateList(L,a,7);
  ex(L,30,60,L1);
  int len;
  len=ListLength(L);
  bool b;
  b=GetElem(L,3,e);
  len=LocatElem(L,55);
  b=ListInsert(L,5,100);
  b=ListDelete(L,3,e);
}