자료구조 •연결리스트-2(LinkedList)•

연결리스트-2(LinkedList)

#include <stdio.h>
#include <malloc.h>
 
typedef int element;
typedef struct node {
    element data;
    node *link;
}node;
 
node *head, *temp, *tail;
int N, M, x, y;
char ins;
 
void initList()
{
    head = (node *)malloc(sizeof(node));
    head->link = NULL;
    tail = (node *)malloc(sizeof(node));
    tail->link = NULL;
}
 
void insertList(element data) //가장 끝에 추가
{
    node *newnode;
    newnode = (node *)malloc(sizeof(node));
    newnode->data = data;
 
    if (head->link == NULL)
    {
        head->link = newnode;
        newnode->link = NULL;
        tail = newnode;
    }
    else
    {
        newnode->link = NULL;
        tail->link = newnode;
        tail = newnode;
    }
}
 
void insertPos(int pos, int num) //pos 위치부터 num개 추가
{
    temp = head;
    for (int i = 0; i < pos; i++)
        temp = temp->link;
 
    for (int i = 0; i < num; i++)
    {
        node *newnode;
        newnode = (node *)malloc(sizeof(node));
 
        scanf(" %d", &(newnode->data));
 
        newnode->link = temp->link;
        temp->link = newnode;
 
        temp = temp->link;
    }
}
 
void deleteList(int pos, int num) //pos 위치부터 num개 삭제
{
    temp = head;
 
    for (int i = 0; i < pos; i++)
        temp = temp->link;
 
    for (int i = 0; i < num; i++)
    {
        if (temp->link == NULL)
            return;
 
        temp->link = temp->link->link;
    }
}
 
void printList()
{
    temp = head;
 
    for (int i = 0; i < 10; i++)
    {
        printf("%d ", temp->link->data);
        temp = temp->link;
    }
}
 
void clearList()
{
    free(head);
    free(tail);
    free(temp);
}
 
bool isOver()
{
    int len = 0;
    temp = head;
    while (temp->link != NULL)
    {
        len++;
        temp = temp->link;
        if (len > 10)
            return true;
    }
    return false;
}
 
int main()
{
    for (int tc = 1; tc <= 1; tc++)
    {
        initList();
        N = 0, M = 0, x = 0, y = 0, ins = 0;
 
        scanf("%d\n", &N);
        for (int i = 0; i < N; i++)
        {
            element data = 0;
            scanf("%d ", &data);
            insertList(data);
        }
        scanf("%d\n", &M);
        for (int i = 0; i < M; i++)
        {
            if (i == 0)
                scanf("%c", &ins);
            else
                scanf(" %c", &ins);
 
            if (ins == 'I')
            {
                scanf(" %d %d", &x, &y);
                insertPos(x,y);
            }
            else if (ins == 'D')
            {
                scanf(" %d %d", &x, &y);
                deleteList(x,y);
            }
            else if (ins == 'A')
            {
                scanf(" %d", &y);
                for (int j = 0; j < y; j++)
                {
                    element data = 0;
                    scanf(" %d", &data);
                    insertList(data);
                }
            }
        }
 
        printf("#%d ", tc);
        printList();
        printf("\n");
 
        clearList();
    }
 
    return 0;
}