数据结构 顺序表及合并

#include<stdio.h>
#include<malloc.h>
typedef int DataType;
struct SeqList{
	int n;
	int Maxnum;
	DataType *element;
};

typedef struct SeqList *PSeqList;

PSeqList createSeqList(int m);//创建表 
int searchElement(PSeqList pseqlist,DataType element);//搜索某个元素 
int insertForward(PSeqList pseqlist,int position,DataType element);//元素前插入
int insertBack(PSeqList pseqlist,int position,DataType element);//元素后插入
int deleteElement(PSeqList pseqlist,DataType element);
int printfAll(PSeqList pseqlist);//打印全部 
int isNullList(PSeqList pseqlist);//判断是否为空 
PSeqList combineAnotherList(PSeqList one,PSeqList another);

 

#include "SeqList.h "
PSeqList createSeqList(int m){
	PSeqList pseqlist = (PSeqList)malloc(sizeof(struct SeqList));
	if(pseqlist != NULL){
		pseqlist->element = (DataType*)malloc(sizeof(DataType) *m);
		if(pseqlist-> element != NULL){
			pseqlist -> Maxnum = m;
			pseqlist -> n = 0;
			return pseqlist;
		}
	}
	printf("Create SeqList fail!");
	return NULL;
} 

int isNullList(PSeqList pseqlist){
	return (pseqlist ->n ==NULL);// true is 1 ,false is 0	
}

int searchElement(PSeqList pseqlist,DataType element){
	int i = 0 ;
	for(i;i < pseqlist ->n;i++){
		if(pseqlist -> element[i] == element){
			printf("%d element is the %dth element in the list\n",element,i);
			return 0;
		} 
	}
	if(i>=pseqlist->n)
		printf("the element value %d  does not exist!\n",element);
	return -1;
}

int insertForward(PSeqList pseqlist,int position,DataType element){
	int i;
	if(pseqlist->n > pseqlist->Maxnum)
		printf("overflow!");
		
	if(position < 0 || position > pseqlist->n) 
	    return 0;
	
	pseqlist ->element[position] = element;
	
	for(i=pseqlist->n;i >=position ;i--){
		pseqlist -> element[i+1] = pseqlist->element[i];
		pseqlist -> n ++ ;
	}
	return 1;
}//元素前插入，指定位置，插入多少 

int insertBack(PSeqList pseqlist,int position,DataType element){
	int i;
	if(pseqlist->n > pseqlist->Maxnum)
		printf("overflow!");
		
	if(position < 0 || position > pseqlist->n) 
	    return 0;
	
	pseqlist ->element[position+1] = element;
	
	for(i = pseqlist-> n;i >= position+1 ;i--){
		pseqlist -> element[i+1] = pseqlist->element[i];
		pseqlist ->n ++ ;
	}
	return 1;
}//元素后插入，指定位置，插入多少 

int deleteElement(PSeqList pseqlist,DataType element){
	int i = 0 ,j;
	for(i;i < pseqlist ->n;i++){
		if(pseqlist -> element[i] == element) {
			for(j=i;j < pseqlist->n	 ;j++){
				pseqlist -> element[j] = pseqlist->element[j+1];				
			}
			pseqlist ->n -- ;
			printf("the element value %d is deleted\n",element,i);
			return 0;
		} 
	}
	if(i>=pseqlist->n)
		printf("the element value %d  does not exist!\n",element);
	return -1;
	
}

int printfAll(PSeqList pseqlist){
	int i = 0 ;
	if(isNullList(pseqlist) == 1)
		printf("the list is a nulllist!");
	for(i;i < pseqlist ->n;i++){
		printf("%3d",pseqlist->element[i]); 
	}
	printf("\n");
}
PSeqList combineAnotherList(PSeqList one,PSeqList another){
    int q = one ->n + another ->n;
    int i = one ->n;
    int j = 0;
    PSeqList combinelist = createSeqList(q+50);
    combinelist ->n = q;
        
    for(i,j;j<i;j++){
        combinelist ->element[j] = one->element[j];
    }
    for(i,j=0;i<=q;i++,j++){
        combinelist ->element[i] = another->element[j];
        //bug : j = 0 j is chaged in the first for! 
    }
    
    return combinelist;
} 

#include "SeqList.h"
#include<stdio.h> 
int main(){
	int i,j,n,d,s;
	PSeqList pseqlist;
	printf("input the length the list, for example 12 ,33 and so on  :");
	scanf("%d",&n);
    pseqlist = createSeqList(n+50);
	printf("\n input %d number,use space to divide them:\n");
	
	for(i = 0;i<n;i++){
		scanf("%d",&j);
		insertForward(pseqlist,i,j);
	}
		
		
	printf("show all the element:\n");
	printfAll(pseqlist);
	
	printf("which  element do you want to search input its value :\n");
	scanf("%d",&s);
	searchElement(pseqlist,s);
	
	printf("which  element do you want to delete input its value :\n");
	scanf("%d",&d);
	deleteElement(pseqlist,d);
	printf("show the elements after deleting:\n");
	printfAll(pseqlist);
	return 0;
}