单向链表基本操作

/*
 * link.c
 */
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#define NULL 0
#define LEN sizeof(struct student)

struct student {
	long num;
	float score;
	struct student *next;
};

//节点数
int n;
int main(int argc, char *argv[]) {
	//声明函数
	struct student *create(void);
	void print(struct student *head);
	struct student *del(struct student *head,long num);
	struct student *insert(struct student *head,struct student *stu);

	struct student *new,*afterDel,*afterInsert;
	long delnum = 0;

	printf("Enter nodes end by 0,0 \n");
	new = create();
	printf("After Create ");
	print(new);
	printf("Enter del num:");
	scanf("%ld",&delnum);
	printf("Del node ");
	afterDel = del(new,delnum);
	printf("After Del ");
	print(afterDel);
	struct student *newStu;
	newStu = (struct student *) malloc(LEN);
	scanf("%ld,%f", &newStu->num, &newStu->score);
	afterInsert = insert(afterDel,newStu);
	printf("After Insert ");
	print(afterInsert);
	exit(0);

}
/**
 *功能：创建动态链表。思路为，p1开辟新节点,p2指向链表最后中的最后一个节点
 *返回值：新链表的头指针
 */
struct student *create(void) {

	struct student *head, *p1, *p2;
	n = 0;
	//开辟新空间,并将(void *)强制转换成(struct student *)
	p1 = p2 = (struct student *) malloc(LEN);
	scanf("%ld,%f", &p1->num, &p1->score);
	head = NULL;
	while (p1->num != 0) {

		n = n + 1;
		if (n == 1)
			head = p1;
		else
			p2->next = p1;
		p2 = p1;
		p1 = (struct student *) malloc(LEN);
		scanf("%ld,%f", &p1->num, &p1->score);
	}
	p2->next = NULL;
	return head;

}

/**
 *功能：输出链表内容
 */
void print(struct student *head) {

	struct student *p;
	printf("The dynamiclink has %d nodes:\n", n);
	p = head;
	if (head != NULL) {
		do {
			printf("%ld %5.1f\n", p->num, p->score);
			p = p->next;
		} while (p != NULL);
	}
}

/**
 * 功能：删除节点
 */
struct student *del(struct student *head,long num){

	struct student *p1,*p2;
	if(head == NULL){
		printf("The link is null!\n");
		return head;
	}
	p1 = head;
	while(num != p1->num && p1->next != NULL){
		p2 = p1;
		p1 = p1->next;
	}
	if(num == p1->num){
		//只有一个节点
		if(p1 == head){
			head = p1->next;
		}else{
			p2->next = p1->next;
		}
		printf("delete:%ld\n",num);
		n = n - 1;
	}else{
		printf("%ld not be found\n",num);
	}
	return head;
}

/**
 * 功能：插入新节点,实现简单的按num升序排序的链表中插入，并保证结果为升序
 */
struct student *insert(struct student *head,struct student *stu){

	struct student *p,*p1,*p2;
	p1 = head;
	p2 = stu;
	//链表为空
	if(head == NULL){
		head = p2;
		p2->next = NULL;
	}else{
		//寻找待插节点位置
		while((p2->num > p1->num) && (p1->next != NULL)){
			p = p1;
			p1 = p1->next;
		}
		//
		if(p2->num <= p1->num){
			//只有一个节点，则插入该节点之前
			if(head == p1){
				//插入第一个节点之前
				head = p2;
			}else{
				//插到p所指节点之后
				p->next = p2;
			}
			p2->next = p1;
		}else{
			//插入到最后节点之后
			p1->next = p2;
			p2->next = NULL;
		}
		n = n + 1;
		return head;
	}
}