链表的常用操作

一、链表的常用操作

1.创建链表

/*申请链表*/
linklist list_create(){
	linklist H;
	/*1.申请地址*/
	H = (linklist)malloc(sizeof(listnode));
	if(H == NULL){
		printf("malloc failed\n");
	}
	/*2.赋值*/
	H->data = 0;
	H->next = NULL;
	return H;
}

2.实现链表的尾部插入

/*尾部插入*/
int list_tail_inster(linklist H, data_t value){
	linklist p;
	linklist q;
	if(H == NULL){
		printf("H is NULL\n");
		return -1;
	}
	/*创建新的节点*/
	if((p=(linklist)malloc(sizeof(listnode))) == NULL){
		printf("malloc failed\n");
		return -1;
	}
	p->data = value;
	p->next = NULL;
	/*查找尾节点*/
	q = H;
	while (q->next != NULL){
		q = q->next;
	}
	/*赋值*/
	q->next = p;
	return 0;
}

3.链表的遍历

int list_show(linklist H){
	linklist p;
	if(H == NULL){
		printf("H is NULL\n");
		return -1;
	}
	p = H;
	while(p->next != NULL){
		printf("%d ", p->next->data);
		p = p->next;
	}
	puts("");
	return 0;
}

4.获取链表某一位置的结点

linklist list_get(linklist H, int pos){
	linklist p;
	int i;
	if(H == NULL){
		printf("H is invslid\n");
		return NULL;
	}
	if(pos == -1)
		return H;
	if(pos < -1){
		printf("pos is invalid\n");
		return NULL;
	}
	p = H;
	for(i = 0; i<=pos; i++){
		p = p->next;
		if(p == NULL){
			printf("pos is invalid\n");
			return NULL;
		}
	}
	return p;
}

5.链表在某一位置插入

int list_inset(linklist H, data_t value, int pos){
	
	linklist q,p;

	if(H == NULL){
		printf("H is NULL\n");
		return -1;
	}
	/*找到插入位置的前一个节点*/
	p = list_get(H, pos-1);
	if(p == NULL){
		return -1;
	}
	/*创建新的节点*/
	if((q = (linklist)malloc(sizeof(listnode))) == NULL){
		printf("malloc failed\n");
		return -1;
	}
	q->data = value;
	/*插入*/
	q->next = p->next;
	p->next = q;
	return 0;
}

5.删除某一位置的值

int List_delete(linklist H, int pos){
	linklist q,p;
	if(H == NULL){
		return -1;
	}

	p = list_get(H, pos-1);
	if(p == NULL){
		return -1;
	}
	
	if(p->next == NULL){
		printf("delete is invalid\n");
		return -1;
	}

	q = p->next;
	p->next=p->next->next;

	free(q);
	q = NULL;

	return 0;
}
}

6.链表的遍历

int list_show(linklist H){
	linklist p;
	if(H == NULL){
		printf("H is NULL\n");
		return -1;
	}
	p = H;
	while(p->next != NULL){
		printf("%d ", p->next->data);
		p = p->next;
	}
	puts("");
	return 0;
}