11.30学习打卡

学习时机

19:00——22:00链表的学习

学习时间3小时，尝试链表的使用与用法.

#include <stdio.h>
#include <stdlib.h>
struct node {
	int date;//数据域
	struct node* next;//指针域
};
struct node* createList() {
	struct node*headnode = (struct node*)malloc(sizeof(struct node));
	headnode->date = 1;
	headnode->next = NULL;
	return headnode;
};
//创建节点
struct node* createnode(int date) {
	struct node* newnode = (struct node*)malloc(sizeof(struct node));//headnode为结构体变量，使用前需要初始化
	newnode->date = date;
	newnode->next = NULL;
	return newnode;
};
void printflist(struct node* headnode) {
	struct node* pmove = headnode->next;
	while (pmove) {
		printf("%d ", pmove->date);
		pmove = pmove->next;
	}
	printf("\n");
}
void insertnodebyhead(struct node* headnode, int date) {//链表--头插
	struct node* newnode = createnode(date);
	newnode->next = headnode->next;
	headnode->next = newnode;
}
void insertnodenexthead(struct node* headnode,int date){//链表--尾插
	struct node* newnode =createnode(date);
	node *p=headnode;
	while(p->next!=NULL){
	p=p->next;
	}
	p->next=newnode;
	p=newnode;
}

void deletenodebyappoin(struct node* headnode, int posdate) {//链表的删除
	struct node*posnode = headnode->next;
	struct node* posnodefront = headnode;
	if (posnode == NULL) {
		printf("000");
	} else {
		while (posnode->date != posdate) {
			posnodefront = posnode;
			posnode = posnodefront->next;
			if (posnode == NULL) {
				printf("没有找到");
				break;
			}
		}
		posnodefront->next = posnode->next;
		free(posnode);
	}
}
int main() {
	struct node* list = createList();
	insertnodebyhead(list, 1);
	insertnodebyhead(list, 5);
	insertnodebyhead(list, 3);
	insertnodenexthead(list,9);
	insertnodenexthead(list,10);
	printflist(list);
	deletenodebyappoin(list, 5);
	printflist(list);
	system("pause");
	return 0;
	
}

通过以上代码实现了链表的头插与尾插，链表数据删除，

 效果图