单链表的建立，插入，删除，查找

#include<iostream>
using namespace std;
struct List
{
    double num;
    List* next;
};

int main()
{
    List* head, * p;
    head = new List;

    //链表的建立 头节点不为空
    p = head;
    int n = 3;
    while (n--)
    {
        p->num = n;
        p->next = new List;//记得要先创立空间，再进行下一条语句进行连接
        p = p->next;
    }

    n = 3;//链表的建立测试
    p = head;
    while (n--)
    {
        cout << p->num << endl;
        p = p->next;
    }
    cout << "FOUND OVER!" << endl;
    
	//链表的查找
    n = 3;
    p = head;
    while (n--)
    {
        if (1 == p->num)
            cout << "I FIND IT." << endl;
        p = p->next;//遍历的语句
    }

    //链表的插入
    n = 1;
    p = head;

    List *t;t=new List;    //t是中间插入
    while (n--)
    {
        p = p->next;
    }
    t->next=p;
    head->next=t;
    t->num=4;

    //a是头插入
    List* a = new List;
    a->next = head;
    head = a;
    a->num = 10;

    //b是尾插入
    List* b = new List;
    p = head;
    n = 4;//虽然建立有五个节点，但是因为p已经处于不为空的头节点，因此只需要循环四遍
    while (n--)
        p = p->next;
    p->next = b;
    p = b;
    b->num = 20;




    n = 6;//链表的插入测试
    p = head;
    while (n--)
    {
        cout << p->num << endl;
        p = p->next;
    }
    cout << "INSECT OVER!" << endl;
    
    //链表的删除
    p = head;
    p = p->next;
    p->next = t->next;
    delete t;


    n = 5;//链表的删除测试
    p = head;
    while (n--)
    {
        cout << p->num << endl;
        p = p->next;
    }
    cout << "DELETE OVER!" << endl;
}