AcWing单链表数据结构做法及AC做法

题目

826. 单链表

数据结构做法

#include <cstdio>
#include <malloc.h>

typedef struct LNode* PtrLNode;
struct LNode
{
    int x;
    int k;
    PtrLNode next;
}LNode;

int main()
{
    int n;
    scanf("%d", &n);
    PtrLNode head = (PtrLNode)malloc(sizeof(LNode));
    head -> k = 0;
    char c;
    int k, x, cnt = 1;
    for (int i = 1; i <= n; i ++ )
    {
        getchar();
        scanf("%c", &c);
        if (c == 'H')
        {
            scanf("%d", &x);
            PtrLNode node = (PtrLNode)malloc(sizeof(LNode));
            node -> x = x;
            node -> k = cnt;
            node -> next = head -> next;
            head -> next = node;
            cnt ++ ;
        }
        else if (c == 'I')
        {
            scanf("%d %d", &k, &x);
            PtrLNode node = head;
            while (node != NULL)
            {
                if (node -> k == k)
                {
                    PtrLNode newNode = (PtrLNode)malloc(sizeof(LNode));
                    newNode -> x = x;
                    newNode -> k = cnt;
                    newNode -> next = node -> next;
                    node -> next = newNode;
                    break;
                }
                node = node -> next;
            }
            cnt ++ ;
        }
        else if (c == 'D')
        {
            scanf("%d", &k);
            PtrLNode node = head;
            while (node != NULL)
            {
                if (node -> k == k)
                {
                    node -> next = node -> next -> next;
                    break;
                }
                node = node -> next;
            }
        }
    }
    
    PtrLNode node = head -> next;
    while (node != NULL)
    {
        printf("%d ", node -> x);
        node = node -> next;
    }
    return 0;
}

这个方法会超时。

AC做法

#include <cstdio>

const int N = 100010;

int idx, e[N], ne[N], head;

void init()
{
    head = -1;
    idx = 1;
}

void add_to_head(int x)
{
    e[idx] = x;
    ne[idx] = head;
    head = idx ++ ;
}

void add(int k, int x)
{
    e[idx] = x;
    ne[idx] = ne[k];
    ne[k] = idx ++ ;
}

void remove(int k)
{
    ne[k] = ne[ne[k]];
}

int main()
{
    int n;
    scanf("%d", &n);
    char c;
    int k, x;
    init();
    for (int i = 1; i <= n; i ++ )
    {
        getchar();
        scanf("%c", &c);
        if (c == 'H')
        {
            scanf("%d", &x);
            add_to_head(x);
        }
        else if (c == 'I')
        {
            scanf("%d %d", &k, &x);
            add(k, x);
        }
        else if (c == 'D')
        {
            scanf("%d", &k);
            if (k == 0)
                head = ne[head];
            else
                remove(k);
        }
    }
    
    for (int i = head; ~ i; i = ne[i])
        printf("%d ", e[i]);
    return 0;
}

其实就是用数组模拟了链表。