#include <stdio.h>
#include <time.h>
#include <iostream>
using namespace std;
#include <stdlib.h>
typedef struct LNode
{
    int data;
    struct LNode *next;
} LNode, *LNodeList;
void InitList_Head(LNodeList &L) // 头插法
{
    L = new LNode;
    L->data = 0;
    L->next = NULL;
    for (int i = 0; i < 10; i++)
    {
        LNodeList s = new LNode;
        s->data = i;
        s->next = L->next;
        L->next = s;
    }
}
void InitList_Tear(LNodeList &L) // 尾插法
{
    L = new LNode;
    // L->data = 0;
    LNodeList r = L;
    L->next = NULL;
    srand(time(NULL));
    for (int i = 1; i <= 30; i++)
    {
        LNodeList s = new LNode;
        s->data = rand() % 20;
        s->next = nullptr;
        r->next = s;
        r = s;
    }
}
void printfList(LNodeList L) // 打印单链表
{
    LNodeList q = L->next;
    int i = 0;
    while (q != NULL)
    {
        printf("%d ", q->data);
        i++;
        q = q->next;
    }
    printf("单链表长度:%d\n", i);
}
void Delete_Same_Node(LNodeList &head) // 删除重复结点
{
    LNodeList p;
    LNodeList q;
    LNodeList s;
    for (p = head; p; p = p->next)
    {
        // s = p;
        for (q = p->next, s = p; q;)
        {
            if (p->data == q->data)
            {
                s->next = q->next;
                delete q;
                q = s->next;
            }
            else
            {
                s = q;
                q = q->next;
            }
        }
    }
}
int main()
{
    LNodeList A;
    InitList_Tear(A); // 尾插法
    printfList(A);
    Delete_Same_Node(A);
    printfList(A);
}