单向链表模板

#include<fstream>
#include <iostream>
using namespace std;

struct Node
{
    int data;
    Node* next;
};

//初始化
Node* InitNode()
{
    Node *head = (Node*)malloc(sizeof(Node));
    if (head == NULL)   return NULL;
    (head)->data = 0;
    (head)->next = NULL;
    return head;
}

//头插法
void HeadInsertNode(Node** head,int key)
{
    Node* newnode = (Node*)malloc(sizeof(Node));
    newnode->data = key;
    newnode->next = (*head)->next;
    (*head)->next = newnode;
}

//尾插法
void TailInsertNode(Node** head, int key)
{
    Node* temp = *head;
    while (temp->next != NULL)
    {
        temp = temp->next;
    }
    Node* newnode = (Node*)malloc(sizeof(Node));
    newnode->data = key;
    newnode->next = NULL;
    temp->next = newnode;
}

//排序链表
void SortNode(Node** head)
{
    Node* t1;
    Node* t2;
    for (t1 = (*head)->next; t1 != NULL; t1 = t1->next)
    {
        for (t2 = t1->next; t2 != NULL; t2 = t2->next)
        {
            if (t1->data > t2->data)//从小到大
            {
                Node* t3 = (Node*)malloc(sizeof(Node));
                t3->data = t1->data;
                t1->data = t2->data;
                t2->data = t3->data;
            }
        }
    }
}

//删除该结点
void deleteNode(Node** pre)
{
    Node* node = (*pre)->next;
    (*pre)->next = (*pre)->next->next;
    delete(node);
}

//删除相同元素
void SameDelete(Node** head)
{
    if ((*head)->next != NULL)
    {
        Node* nownode = (*head)->next;
        while (nownode != NULL)
        {
            if (nownode->next != NULL)
            {
                if (nownode->next->data == nownode->data)
                {
                    deleteNode(&nownode);
                }
                else
                    nownode = nownode->next;
            }
            else
                return;
        }
    }
}

//合并两个链表
void MergeNode(Node** l1, Node** l2)
{
    if ((*l1)->next != NULL)
    {
        Node* nownode = *l1;

        while (nownode->next != NULL)
        {
            int flag = 0;
            for (Node* temp = (*l2)->next; temp != NULL; temp = temp->next)
            {
                if (nownode->next->data == temp->data)
                {
                    flag = 1;
                    deleteNode(&nownode);
                    break;
                }
            }
            if (flag == 0)
                nownode = nownode->next;
        }
    }
}

//输出链表
void PrintNode(Node** head)
{
    if ((*head)->next != NULL)
    {
        Node* temp = (*head)->next;
        while (temp != NULL)
        {
            cout << temp->data << " ";
            temp = temp->next;
        }
        cout << endl;
    }
}

//翻转链表
void TurnOverNode(Node** head)
{
    if ((*head)->next != NULL)
    {
        Node* pre;
        Node* nownode = (*head)->next;
        Node* nextnode = (*head)->next->next;
        nownode->next = NULL;
        while (nextnode != NULL)
        {
            pre = nownode;
            nownode = nextnode;
            nextnode = nextnode->next;
            nownode->next = pre;
        }
        nextnode = (Node*)malloc(sizeof(Node));
        nextnode->data = 0;
        nextnode->next = nownode;
        (*head) = nextnode;
    }
}

//用来读取文件
void CreateNode(Node** head)
{
    fstream fp;
    fp.open("  ", ios::in);
    if (!fp.is_open()) return;


    fp.close();
}

//销毁链表所有结点
void DestroyNode(Node** head)
{
    if ((*head)->next != NULL)
    {
        Node* temp1 = ( * head)->next;
        Node* temp2;

        while (temp1!= NULL)
        {
            temp2 = temp1->next;
            free(temp1);
            temp1 = temp2;
        }
    }
    *head = NULL;
}

//删除倒数第n个结点
void DeleteNNode(Node** head,int n)
{
    Node* temp1 = *head;
    int step = n + 1;
    while (step != 0)
    {
        temp1 = temp1->next;
        if (temp1 == NULL)
        {
            cout << "没有第" << n << "个结点" << endl;
            return;
        }
        step--;
    }

    Node* temp2 = (*head);
    while (temp2 != NULL)
    {
        temp2 = temp2->next;
        temp1 - temp1->next;
    }
    deleteNode(&temp1);
}

int main()
{
    Node* head=InitNode();
  
    TailInsertNode(&head, 48);
    TailInsertNode(&head, 60);
    TailInsertNode(&head, 50);
    TailInsertNode(&head, 88);
    TailInsertNode(&head, 42);
    TailInsertNode(&head, 30);
    TailInsertNode(&head, 60);
    TailInsertNode(&head, 48);
    TailInsertNode(&head, 88);
    TailInsertNode(&head, 73);
    TailInsertNode(&head, 88);
    TailInsertNode(&head, 30);
    PrintNode(&head);

    SortNode(&head);
    PrintNode(&head);

    SameDelete(&head);
    PrintNode(&head);

    TurnOverNode(&head);
    PrintNode(&head);   

    DestroyNode(&head);
}

 

突然发现一直没有链表