各种删除插入节点的函数

//删除当前所指节点节点，并返回头节点
void deleteNodeWithData(Node **head, Node* nodeToDelete) {
    if (nodeToDelete == NULL || *head == NULL) {
        return;
    }

    if (*head == nodeToDelete) {
        *head = nodeToDelete->next;
    } else {
        Node* current = *head;
        while (current != NULL && current->next != nodeToDelete) {
            current = current->next;
        }
        if (current != NULL) {
            current->next = nodeToDelete->next;
        }
    }

    free(nodeToDelete);
}

//将当前节点所指向的节点数据插入到另外一个链表
void addToAnotherList(Node *current, Node *targetListHead)
{
	if (current == NULL || targetListHead == NULL)
	{
		// 如果当前指针或目标链表头指针为空，无法执行操作，返回
		return;
	}

	// 获取当前节点的数据
	int data = current->data;

	// 找到目标链表的尾节点
	Node *tail = targetListHead;

	// 特别注意：在遍历之前，确保目标链表不为空
	if (tail == NULL)
	{
		// 如果目标链表为空，将新节点设置为目标链表的头节点
		Node *newNode = new Node;
		newNode->data = data;
		newNode->next = NULL;
		targetListHead = newNode;
		return;
	}

	// while (tail->next != NULL) {
	//     tail = tail->next;
	// }
	for (; tail->next; tail = tail->next)
		;
	// 创建新节点并将数据存储在其中
	Node *newNode = new Node;
	newNode->data = data;
	newNode->next = NULL;

	// 将新节点连接到目标链表的尾部
	tail->next = newNode;
}

//将value插入到链表尾部
void insertNode(struct Node** head, int data) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = data;
    newNode->next = NULL;

    if (*head == NULL) {//空指针
        *head = newNode;
    } else {
        struct Node* current = *head;
        while (current->next != NULL) {
            current = current->next;
        }
        current->next = newNode;
    }
}