C语言实现线性表的基本操作详解

#include<stdio.h>
#include<stdlib.h>
#define MAX 20
#define LISTINCREMENT 10


typedef struct{
	int *elem;
	int length;
	int listsize;
}sqlist;

 void Creatlist(sqlist &L){
 	//创建一个线性表
	 L.elem=(int *)malloc(MAX*sizeof(int)) ;
	 if(!L.elem)return ;
	 L.listsize=MAX;
	 printf("输入表的长度：");
	 scanf("%d",&L.length);
	 printf("输入%d的个数：",L.length); 
	 for(int i=0;i<L.length;i++)
	 scanf("%d",&L.elem[i]);
 }
 
 //开始添加取地址符号 
 void Traverse(sqlist &L){
 	//遍历
	 printf("表中数据为：") ;
	 for(int i=0;i<L.length;i++)
	 printf("%3D",L.elem[i]) ;
	 printf("\n");
 }
 
//查找
 void LocateElem(sqlist &L,int e){
	 int i;
	 printf("输入要查找的元素：\n");
	 scanf("%d",&e);
	 for(int i=0;i<L.length;i++)
	 {
	 	if(L.elem[i]==e){
	 		printf("查找成功，查找元素为%d",L.elem[i]);
	 		printf("\n");
	 		return ;
		 }//if
	  } //for
 	printf("查找失败！");
	 printf("\n"); 
	 
 }//void

//确定要删除的元素
 int makesureElem(sqlist &L,int e){
 	int i;
 	
	 for(i=0;i<L.length;i++){
	 	if(L.elem[i]==e){
	 		printf("要删除的元素 位置为%d",i+1);
	 		printf("\n");
	 		return (i+1);
		 }//if
	 } //for
	 printf("元素不存在！");
	 printf("\n");
	 
	 return 0;
 }
 
 //插入某个元素
 void Listinsert(sqlist &L){
 	int i;int e;
 	printf("输入要插入位置及元素\n");
 	scanf("%d%d",&i,&e);
 	printf("在顺序线性表中第%d个位置之前插入新的元素%d。\n",i,e);
 	//在顺序线性表L中第i个位置之前插入新的元素e
	 if(i<1||i>L.length+1)return;
//	 1<=i<=listlength(L)+1;
int *p,*q;
q=&(L.elem[i-1]);
for(p=&(L.elem[L.length-1]);p>=q;--p)*(p+1)=*p;
*q=e; 

++L.length;
 
return;
 }
 
 int listdelete(sqlist &L){
 	//删除元素
	 int i,e;
	 printf("输入要删除的元素\n");
	 scanf("%d",&e);
	 i=makesureElem(L,e);
	 if((i<1)||(i>L.length))return 0;
	 else{
	 	int *p,*q;
	 	p=&(L.elem[i-1]);
	 	e=*p;
	 	q=L.elem+L.length-1;
	 	for(++p;p<=q;++p)*(p-1)=*p;//被删除元素之后的元素左移
		 -L.length;
		 printf("元素被删除！"); 
		  
	 }
	  return 0;
 } 
 
 
 
int main(){
	sqlist L;
Creatlist(L);

	Traverse(L);
	LocateElem(L,1);
	
	Listinsert(L);
	Traverse(L);;
	
	listdelete(L);
	Traverse(L);
	return 0;
} 

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>

struct  danlianbiao_node{

int data;
struct danlianbiao_Node *next;

};

//base的结构体 
 struct  danlianbiao{

int length;
struct danlianbiao_Node *base;

};

  struct danlianbiao *danlianbiao_init();
 void danlianbiao_free(struct danlianbiao *list); 
//清除 
 void danlianbiao_clear(struct danlianbiao *list);
 int danlianbiao_length(struct danlianbiao *list);
 
//添加 
 void danlianbiao_add(struct danlianbiao *list,int index,int value);
 void danlianbiao_remove(struct danlianbiao *list,int index);
 
//修改
 void danlianbiao_set(struct danlianbiao *list,int index,int value);
 int danlianbiao_get(struct danlianbiao *list,int index );
 
 //查询
 int danlianbiao_lookup(struct danlianbiao *list,int value);
int danlianbiao_isempty(struct danlianbiao *list,int value);



void menu()
{
	printf("********目录*******\n");
	printf("输出单链表中的各元素值1\n");
	printf("在单链表中插入数据元素2\n");
	printf("在单链表中插入数据元素3\n");
	printf("寻找单链表中某一个数值4\n");
	printf("结束程序           0\n"); 
	printf("**********************************\n"); 
}

int main(int arGC, char *argv[]) {
	
	int n,m,i,e;
	
  printf("请输入元素的个数 :");
  scanf("%d",&n);
  printf("以此输入%d个数据元素 :",n); 
  menu();
  printf("输入你的选择：");
  scanf("%d",&m);
  switch(m)
  {
  	
  	case 1:
  		printf("现在链表的元素为：");
		   break;
	case 2:
		printf("依次输入插入位置和数据元素（空格隔开）：");
		scanf("%d %d",&i,&e);
		
   } 
	return 0;
}



 struct danlianbiao *danlianbiao_init(){
 struct danlianbiao *list=NULL;
 list=( struct danlianbiao *)malloc(sizeof( struct danlianbiao ));
 list->base=(struct danlianbiao_Node *)malloc(sizeof(struct danlianbiao_Node));
 list->base->data=-1;
  list->base->next=NULL;
  list->length=0;
  return list;
 
 }
 
 
  
 void danlianbiao_free(struct danlianbiao *list){
 struct danlianbiao_Node *pnode=NULL;//可能出现问题指针 
 while(list->base!=NULL){
 	pnode=list->base;
 	list->base=pnode->next;
 	free(pnode);
 	
 }//while
  free(list);
 
 } 
 

//清除 
 void danlianbiao_clear(struct danlianbiao *list){
 	
 	struct danlianbiao_Node *next=NULL;//可能出现问题指针 
 	struct danlianbiao_Node *pnode=NULL;
 while(list->base->next!=NULL){
 next=list->base->next;
 	list->base->next=next->next;
 	free(pnode);
 	
 }//while
 list->length=0;
 }
 
//获得单链表的长度 
 int danlianbiao_length(struct danlianbiao *list){
 	
 	
 	
 }
 
//添加 ,该函数没有错误 
 
 void danlianbiao_add(struct danlianbiao *list,int index,int value){
 	int i=0;
 	struct danlianbiao_Node *pnode=NULL;
	 struct danlianbiao_Node *p=NULL;
	 p=(struct danlianbiao_Node *)malloc(sizeof(struct danlianbiao_Node ));
	 p->data=value;
	 pnode=list->base;
	 while(i<index-1&&pnode!=NULL){
	 	pnode=pnode->next;
		 i++; 
	 }//while
	 p->next=pnode->next;
	 pnode->next=p;
	 list->length++;
	
 } 
 //
 //移除这一项没有错误 

 void danlianbiao_remove(struct danlianbiao *list,int index){
 struct danlianbiao_Node *pnode=NULL;
	 struct danlianbiao_Node *p=NULL;
	 p=(struct danlianbiao_Node *)malloc(sizeof(struct danlianbiao_Node ));
	 //有错误 
	 int value;int i;
     p->data=value;
	 pnode=list->base;
	 while(i<index-1&&pnode!=NULL){
	 	pnode=pnode->next;
		 i++; }
		 p=pnode->next;
		 pnode->next=p->next; 
		 free(p);

 } 
  
//设置值 ,这一项没有错误 

 void danlianbiao_set(struct danlianbiao *list,int index,int value){
 		int i=0;
 	struct danlianbiao_Node *pnode=NULL;
	 struct danlianbiao_Node *p=NULL;
	 p=(struct danlianbiao_Node *)malloc(sizeof(struct danlianbiao_Node ));
	
	 p->data=value;
	 pnode=list->base;
	 while(i<index-1&&pnode!=NULL){
	 	pnode=pnode->next;
		 i++; 
	 }//while
 	pnode->data=value;
 	
 }
 
 
//得到一个数值函数方法没有错误 
 
 int danlianbiao_get(struct danlianbiao *list,int index ){
 		int i=0;
 		int value;
 	struct danlianbiao_Node *pnode=NULL;
	 struct danlianbiao_Node *p=NULL;
	 p=(struct danlianbiao_Node *)malloc(sizeof(struct danlianbiao_Node ));
	
	 p->data=value;
	 pnode=list->base;
	 while(i<index-1&&pnode!=NULL){
	 	pnode=pnode->next;
		 i++; 
	 }//while
 return(	pnode->data);
 	
 	
 	
 }
 

 //
 
 int danlianbiao_lookup(struct danlianbiao *list,int value){
 	
 	int i=0;
 		struct danlianbiao_Node *pnode=NULL;
 		for(pnode=list->base->next;pnode !=NULL;pnode=pnode->next){
 			i++;
 			if(pnode->data==value) {
 				return i;
			 }//if
		 }//for
 	return 0;
 }

int danlianbiao_isempty(struct danlianbiao *list,int value){
}