线性单链表

#include<iostream>
using namespace std;
struct student
{
    long num;
    float score;
    struct student *next;
};

int n;
//初始化一个链表
void create(struct student **head)
{
    struct student *p1,*p2;
    n = 0;
    p1 = p2 = new struct student;
    cin>>p1->num;
    cin>>p1->score;
    while (p1->num != 0 )
    {
        n = n+1;
        if (n == 1)
        {
            *head = p1;
        }
        else
        {
            p2->next = p1;
        }
        p2 = p1;
        p1 = new struct student;
        cin>>p1->num;
        if (p1->num == 0 )
        {
            break;
        }
        cin>>p1->score;
    }
    p2->next = NULL;
}
//找到第i个元素
bool find(struct student **head, struct student **ptarget,int i)
{
    struct student *p = *head;
    int n = 1;
    while (p && (n <i) )
    {
        p = p->next;
        n++;
    }

    if (p && (n == i))
    {
        *ptarget = p;
        return true;
    }
    else
        return false;
}
//在第i个节点后插入node
bool insert(struct student **head,struct student *node ,int i)
{
    struct student *pre;
    if (find(head,&pre,i))
    {
        node->next = pre->next;
        pre->next = node;
        return true;
    }
    return false;
}
//删除第i个节点
bool del(struct student **head,int i)
{
    struct student *pre,*target;
    if (find(head,&pre,i-1)&&find(head,&target,i))
    {
        pre->next = target->next;
        delete target;
        return true;
    }
    return false;
}
void print(struct student *head)
{
    while (head)    
    {
        cout<<head->num<<"  "<<head->score<<endl;
        head = head->next;
    }
}
int main()
{
    struct student *head ,*target=0;
    create(&head);
    print(head);
    
    find(&head,&target,2);
    if (target)
    {
        cout<<"find !  "<<target->num<<"  "<<target->score <<endl;
    }
    cout<<"--------insert--------------------------------------------"<<endl;
    struct student *node = new struct student;
    node->num = 20;
    node->score=100;
    insert(&head,node,2);
    
    print(head);
    cout<<"----------del------------------------------"<<endl;
    del(&head,2);
    print(head);
    cout<<""<<endl;
    return 0;
}

另：

#include "iostream"
using namespace std;

typedef struct LinkList
{
    int datainfo;
    LinkList *pnext;
}LinkList;

//动态创建n个节点
void initial(LinkList **head,int n)
{
    
    LinkList *p1,*p2;
    if (n<=0)
    {
        cout<<"please input a positive number !"<<endl;
        return;
    }
    *head = p1 =p2 = new LinkList;
    cout<<"input datainfo:  ";
    cin>>p2->datainfo;
    cout<<endl;
    for (int i = 0 ; i < n -1;i++)
    {
        p2 = new LinkList;
        cout<<"input datainfo:  ";
        cin>>p2->datainfo;
        cout<<endl;
        p1->pnext = p2;
        p1 = p2;
    }
    p2->pnext=0;//不设置会抛出异常
}
//查找第i个结点
bool find(LinkList **head,LinkList **ptarget,int i)
{
    LinkList *p = *head;
    int np = 1;
    while ( (p != NULL) && (np < i) )
    {
        p = p->pnext;
        np++;
    }
    
//    if (np != i)
//    {
//        return false;
//    }
    if (p == NULL)
    {
        return false;
    }
    
    if (np == i )
    {
        *ptarget = p ;
    }
    
    return true;
}
//在指定的节点后插入node
bool insert(LinkList **head,LinkList *node,int i)
{
    LinkList *p =NULL;

    if (find(head,&p,i))
    {
        
        node->pnext = p->pnext;
        p->pnext = node;    
        return true;
    }
    else
        return false;
}

void print(LinkList *head)
{
    LinkList *p = head;
    while (p)
    {
        cout<<p->datainfo<<endl;
        p = p->pnext;
    }
}
int main()
{
    LinkList *head;
    initial(&head,5);

    //LinkList *node = new LinkList;
    //node->datainfo = 6;
//    insert(head,node,1);
    print(head);
    return 0;
}