Description

Given a link list structure named Node.

typedef struct _Node {

    int data;

    struct _Node *next;

} Node;

In this problem, you need to implement five operation for the linked list. 

func1: Node* createList(int *a, int size);

func2: void push_front(Node** head, int val);

func3: Node* copyList(Node* head);

func4: void deleteElementByIdx(Node** head, int idx);

func5: void SwapElementByIdx(Node** head, int idx1, int idx2);

#include <stdio.h> #include <stdlib.h> #include "function.h" void traversal(Node* head); int main(){ int T,M,inst,i; int val,idx1,idx2; scanf("%d%d", &T,&M); Node* head = NULL; int *array = (int*)malloc(sizeof(int)*M); for(i=0; i<M; ++i){ scanf("%d",&array[i]); } if(M > 0){ head = createList(array, M); traversal(head); } while(T--){ scanf("%d",&inst); if(inst == 0){ // insert scanf("%d",&val); push_front(&head, val); }else if(inst == 1){ // copy link list Node* otherHead = copyList(head); /* free original list*/ while(head != NULL){ Node* temp = head; head = head->next; free(temp); } head = otherHead; }else if(inst == 2){ // delete element scanf("%d",&val); deleteElementByIdx(&head, val); }else if(inst == 3){ // swap link element scanf("%d%d",&idx1, &idx2); SwapElementByIdx(&head,idx1,idx2); } traversal(head); } /* free linked list*/ while(head != NULL){ Node* temp = head; head = head->next; free(temp); } return 0; } void traversal(Node* head){ if(head == NULL) return; while(head != NULL){ printf("%d ", head->data); head = head->next; }printf("\n"); }

Note: We guarantee that function 1, 3~5 will not operate on an empty list.

Input

T M

S1 .. SM

t1_command

...

tT_command

T: the number of command ( 0 <= T < 200)

M: the number of initial linked size (0 <= M <= 2000)

Si: the value of the initial array (0 <= Si <= 1000)

ti_command: the command description

(0: push_front, 1: clone, 2: delete, 3: swap)

Hint: 

testcase1 : contain only createList operation

testcase2: contain only push_front operation

testcase3: contain createList , push_front, copyList operation

testcase4: contain createList , push_front , copyList operation, deleteElementByIdx

testcase5: contain all operation 

Output

Output the element in linked list whenever the operation be called. 

Sample Input  Download

Sample Output  Download

Partial Judge Code

12594.c

Partial Judge Header

12594.h

Tags

Add Tag

Discuss