day3数据结构 顺序表

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

#define MAXSIZE 20
typedef int datatype;

typedef struct{
	datatype data[MAXSIZE];
	int len;
}Seqlist,*seqlist;

seqlist create(){
	seqlist list = (seqlist) malloc(sizeof(Seqlist));
	if(list == NULL){
		printf("Allocation failed.\n");
		return NULL;
	}
	list->len = 0;
	return list;
}
int empty_seqlist(seqlist list){
	if(list->len == 0){
		return -1;
	}else{
		return 0;
	}
}

int full_seqlist(seqlist list){
	if(list->len == MAXSIZE){
		return -1;
	}else{
		return 0;
	}
}

int insert_rear(seqlist list,datatype e){
	if(list == NULL || full_seqlist(list)){
		printf("Insertion failed.\n");
		return -1;
	}else{
		list->data[list->len] = e;
		list->len++;
		return 0;
	}
}
int delete_rear(seqlist list){
	if(list == NULL || empty_seqlist(list)){
		printf("Deletion failed.\n");
		return -1;
	}else{
		list->len--;
		return 0;
	}
}
void output(seqlist list){
	if(list == NULL || empty_seqlist(list)){
		printf("The list is empty or doesn't exist.\n");
		return;
	}
	puts("\n");
	for (int i = 0; i < list->len; i++){
		printf("list %d: %d\n",i,list->data[i]);
	}
}
int search_sub(seqlist list,int sub){
	if(list == NULL || empty_seqlist(list) || sub < 0 || sub >= list->len){
		printf("Invalid search option.\n");
		return -1;
	}else{
		printf("list %d: %d\n",sub,list->data[sub]);
		return 0;
	}
}
int insert_sub(seqlist list, int sub, datatype e){
	if(list == NULL || list->len == MAXSIZE || sub < 0 || sub > list->len){
		printf("Invalid subtitle position.\n");
		return -1;
	}else{
		for (int i = list->len; i >= sub; i--){
			list->data[i+1] = list->data[i];
		}
		list->data[sub] = e;
		list->len++;
		return 0;
	}
}

int delete_sub(seqlist list, int sub){
	if(list == NULL || empty_seqlist(list) || sub < 0 || sub >= list->len){
		printf("Invalid subtitle position.\n");
		return -1;
	}else{
		for(int i = sub; i < list->len-1; i++){
			list->data[i] = list->data[i+1];
		}
		list->len--;
		return 0;
	}
}
int update_sub(seqlist list,int sub,datatype e){
	if(list == NULL || empty_seqlist(list) || sub < 0 || sub >= list->len){
		printf("Invalid search option.\n");
		return -1;
	}else{
		list->data[sub] = e;
		return 0;
	}
}
int search_data(seqlist list,datatype e){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return -1;
	}else{
		for(int i = 0; i < list->len;i++){
			if(list->data[i] == e){
				return i;
			}
		}
		return -1;
	}

}
int update_data(seqlist list,datatype e){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return -1;
	}else{
		if(!search_data(list,e)){
			return -1;
		}else{
			int sub = search_data(list,e);
			update_sub(list,sub,e);
			return 0;
		}
	}
}
int remove_data(seqlist list,datatype e){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return -1;
	}else{
		if(!search_data(list,e)){
			return -1;
		}else{
			int sub = search_data(list,e);
			delete_sub(list,sub);
			return 0;
		}
	}
}
int insert_data(seqlist list,datatype e,datatype add){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return -1;
	}else{
		if(!search_data(list,e)){
			return -1;
		}else{
			int sub = search_data(list,e);
			insert_sub(list,sub + 1,add);
			return 0;
		}
	}
}
void remove_duplication(seqlist list){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return;
	}else{
		for(int i = 0; i < list->len -1; i++){
			for(int j = i+1; j < list->len; j++){
				if(list->data[i] == list->data[j]){
					delete_sub(list,j);
					j--;
				}
			}
		}
	}
}
void sort(seqlist list){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return;
	}else{
		for(int i = 0; i < list->len; i++){
			for(int j = 1; j < list->len - i; j++){
				if(list->data[j] < list->data[j-1]){
					datatype temp = list->data[j];
					list->data[j] = list->data[j-1];
					list->data[j-1] = temp;
				}
			}
		}
	}
}
seqlist search_data_group(seqlist list,datatype e){
	if(list == NULL || empty_seqlist(list)){
		printf("List is empty or doesn't exist.\n");
		return NULL;
	}else{
		seqlist temp = create(temp);
		for(int i = 0; i < list->len;i++){
			if (list->data[i] == e){
				temp->data[temp->len] = list->data[i];
				temp->len++;			
			}
		}
		if(temp->len == 0){
			return NULL;
		}
		return temp;
	}
}

int main(int argc, const char *argv[])
{
	seqlist myList = create();
	for (int i = 0;i < 10;i++){
		insert_rear(myList,10-i);
	}
	insert_rear(myList,8);
	insert_rear(myList,7);
	output(myList);
	delete_rear(myList);
	output(myList);
	delete_sub(myList,1);
	output(myList);
	remove_duplication(myList);
	output(myList);
	sort(myList);
	output(myList);
	insert_data(myList,10,5);
	output(myList);
	return 0;
}