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

연결리스트(LinkedList)

-예제를 통한 연결리스트 연습

#include <stdio.h>
#include <malloc.h>
 
typedef int element;
typedef struct node {
    element data;
    node* link;
}node;
 
node *head, *temp;
int N, M, x, y;
int password[1000], arr[1000];
 
void initList()
{
    head = (node *)malloc(sizeof(node));
    head->link = NULL;
}
 
void insertNode(int data)
{
    node *newnode;
    newnode = (node *)malloc(sizeof(node));
    newnode->data = data;
 
    temp = head;
 
    if (head->link == NULL)
    {
        newnode->link = NULL;
        head->link = newnode;
        return;
    }
 
    while (temp->link != NULL)
        temp = temp->link;
 
    newnode->link = NULL;
    temp->link = newnode;
}
 
void insertpos(int pos, int data)
{
    node *newnode;
    newnode = (node *)malloc(sizeof(node));
    newnode->data = data;
 
    temp = head;
 
    for (int i = 0; i < pos; i++)
        temp = temp->link;
 
    newnode->link = temp->link;
    temp->link = newnode;
}
 
void printList()
{
    temp = head;
 
    for (int i = 0; i < 10; i++)
    {
        printf("%d ", (temp->link)->data);
        temp = temp->link;
    }
}
 
void clearList()
{
    free(head);
    free(temp);
}
 
int main()
{
    for (int tc = 1; tc <= 10; tc++)
    {
        char ins = 0;
 
        initList();
 
        scanf("%d\n", &N);
        for (int i = 0; i < N; i++)
        {
            scanf("%d ", &password[i]);
            insertNode(password[i]);
        }
        scanf("%d\n", &M); //명령어 수
        for (int i = 0; i < M; i++)
        {
            if (i == 0)
                scanf("%c %d %d", &ins, &x, &y);
            else
                scanf(" %c %d %d", &ins, &x, &y);
        
            for (int j = 0; j < y; j++)
            {
                scanf(" %d", &arr[j]);
                insertpos(x + j, arr[j]);
            }
        }
 
        printf("#%d ", tc);
        printList();
        printf("\n");
 
        clearList();
    }
    return 0;
}