单链表基本操作

• 结构体创建

typedef struct Node{
	int data;//数据域
	struct Node *next;//指针域
}Node;

• 初始化单链表

Node *createNode(){
	Node *head = NULL;
	if(head == NULL){
		head = (Node*)malloc(sizeof(Node));
		head->next = NULL;
	}
	return head;
}

• 头插法

void addHead(Node *node,int num){
	Node *head = node;
	Node *p = (Node*)malloc(sizeof(Node));
	p->data = num;
	p->next = head->next;
	head->next = p;
}

• 尾插法

void addTail(Node *node,int num){
	Node *temp = node;
	while(temp->next != NULL){
		temp = temp->next;
	}
	Node *p = (Node*)malloc(sizeof(Node));
	p->data = num;
	temp->next = p;
	temp = p;
	temp->next = NULL;
}

• 删除结点

void _remove(Node *node, int num){
	Node *temp = node , *p = node->next;
	while(p != NULL){
		if(p->data == num){
			temp->next = p->next;
		}
		temp = p;
		p = p->next;
	}
} 

• 随机位置插入结点

void addRand(Node *node,int loc,int num){
	Node *temp = node->next;
	while(temp != NULL){
		if(temp->data == loc){
			Node *p = (Node*)malloc(sizeof(Node));
			p->data = num;
			p->next = temp->next;
			temp->next = p;
			break;
		}
		temp = temp->next;
	}
}

• 就地反转链表

void swap(Node *node){
	Node *temp = node->next, *p = NULL, *q = NULL;
	while(temp != NULL){
		//核心代码 
		q = temp->next;//先把temp的下一个节点给q(其实是一个中间量)
		temp->next = p;//反转 
		p = temp;//temp的前一个节点 
		temp = q;//向下一个节点遍历 
	} 	
	while(p != NULL){
		printf("%d\n",p->data);
		p = p->next;
	}
}