shunxubiao.cpp

数据结构中关于顺序表的内容用c++环境运行

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#include<string.h>
//#include<conio.h>

#define ERROR 0
#define ok 1
#define EQUAL 1
#define OVERFLOW -1
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10

struct STU
{
 char name[20];
 char stuno[10];
 int age;
 int score;
}stu[50];
typedef struct STU ElemType;

struct LIST
{
  ElemType *elem;
  int length;
  int listsize;
};

typedef struct LIST List;

int init(List *L)
{
  L->elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
  if(!L->elem) exit(OVERFLOW);
  L->length=0;
  L->listsize=LIST_INIT_SIZE;
  return ok;
}/*init*/

int ListLength(List *L)
{
  return L->length;
}

void GetElem(List L,int i,ElemType *e)
{
  *e=L.elem[i];
}

int EqualList(ElemType *e1,ElemType *e2)
{
  if(strcmp(e1->name,e2->name)==0)
    return 1;
  else
    return 0;
}

int Less_EqualList(ElemType *e1,ElemType *e2)
{
  if(strcmp (e1->name,e2->name)<=0)
    return 1;
  else
   return 0;
}

int LocateElem(List *La,ElemType e,int type)
{
  int i;
  switch (type)
    {
      case EQUAL:
	for(i=0;i<La->length;i++)
	  if(EqualList(&La->elem[i],&e))
	    return 1;
	break;
      default:
	break;
    }
  return 0;
}

void MergeList(List *La,List *Lb,List *Lc)
{
  ElemType *pa,*pb,*pc,*pa_last,*pb_last;
  pa=La->elem;pb=Lb->elem;
  Lc->listsize=Lc->length=La->length+Lb->length;
  pc=Lc->elem=(ElemType *)malloc(Lc->listsize *sizeof(ElemType));
  if(!Lc->elem)  exit(OVERFLOW);
  pa_last=La->elem+La->length-1;
  pb_last=Lb->elem+Lb->length-1;
  while(pa<=pa_last&&pb<=pb_last)
  {
    if(Less_EqualList(pa,pb))  *pc++=*pa++;
    else *pc++=*pa++;
  }
  while(pa<=pa_last) *pc++=*pa++;
  while(pb<=pb_last) *pc++=*pb++;
}
int ListInsert(List *L,int i,struct STU e)
{
  struct STU *p,*q;
  if(i<1||i>L->length+1)  return ERROR;
  q=&(L->elem[i-1]);
  for(p=&L->elem[L->length-1];p>=q;--p)
    *(p+1)=*p;
  *q=e;
  ++L->length;
  return ok;
}/*ListInsert Before i*/

void UnionList(List *La,List *Lb)
{
  int La_len,Lb_len;
  int i;
  ElemType e;

  La_len=ListLength(La);  Lb_len=ListLength(Lb);
  for(i=0;i<Lb_len;i++)
  {
    GetElem(*Lb,i,&e);
    if(!LocateElem(La,e,EQUAL))
       ListInsert(La,++La_len,e);
  }
}

void printlist(List L)
{
  int i;
  printf("name        stuno        age        score\n");
  for(i=0;i<L.length;i++)
      printf("%-10s %s\t%d\t%d\n",L.elem[i].name, L.elem[i].stuno,
	 L.elem[i].age,  L.elem[i].score);
      printf("\n");
}
void main()
{
  struct STU e;
  List La,Lb,Lc;

  printf("\n\n-------------------List Demo is running...-------------\n\n");
  printf("First is InsertList function.\n");
  init(&La);

  strcpy(e.name,"stu1");
  strcpy(e.stuno,"10030312");
  e.age=23;
  e.score=100;
  ListInsert(&La,1,e);
  strcpy(e.name,"stu3");
  strcpy(e.stuno,"10030313");
  e.age=22;
  e.score=100;
  ListInsert(&La,2,e);
  strcpy(e.name,"stu5");
  strcpy(e.stuno,"10030314");
  e.age=23;
  e.score=100;
  ListInsert(&La,3,e);

  printlist(La);
  printf("List A length now is %d.\n\n",La.length);
  getchar();

  init(&Lb);

  strcpy(e.name,"stu5");
  strcpy(e.stuno,"10030314");
  e.age=23;
  e.score=100;
  ListInsert(&Lb,1,e);
  strcpy(e.name,"stu4");
  strcpy(e.stuno,"10030302");
  e.age=22;
  e.score=100;
  ListInsert(&Lb,2,e);

  strcpy(e.name,"stu6");
  strcpy(e.stuno,"10030303");
  e.age=23;
  e.score=100;
  ListInsert(&Lb,3,e);

  printlist(Lb);
  printf("List B length now is %d.\n",Lb.length);
  getchar();

  init(&Lc);
  MergeList(&La,&Lb,&Lc);
  printf("second is La and Lb MergeList Lc:\n");
  printlist(Lc);
  printf("List C length now is %d.\n\n",Lc.length);
  getchar();

  printf("The end is UnionList function .\n");
  printf("Now union List A and List B......\n");
  UnionList(&La,&Lb);
  printlist(La);
  printf("List A length now is %d.\n\n",La.length);
  getchar();

  printf("\nWelcome to visit http://zmo.heha.net !");
  getchar();
}