[C] 개념 다지기 - linked list

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> typedef struct node { int val; struct node_t* next; }node_t; node_t*head; void pop_head() { if (head == NULL) { printf("There is no head\n"); return; } node_t*temp = head; head = temp->next; free(temp); } void pop_last() { if (head == NULL) { printf("there is no head\n"); return; } node_t * current = head; node_t*current_next = current->next; while (current_next->next != NULL) { current = current->next; current_next = current->next; } node_t*temp = current->next; current->next = temp->next; free(temp); } void pop_index(int index) { if (index == 0) { pop_head(); return; } node_t*current = head; for (int j = 0; j < index - 1; j++) { current = current->next; if (current == NULL) { printf("Over the linked list size\n"); return; } } node_t*temp = current->next; current->next = temp->next; free(temp); } void push_head(int val) { if (head == NULL) { head = malloc(sizeof(node_t)); head->val = val; head->next = NULL; return; } node_t*current = malloc(sizeof(node_t)); current->val = val; current->next = head; head = current; } void push(int val) { if (head == NULL) { printf("there is no head\n"); return; } node_t*current = head; while (current->next != NULL) current = current->next; node_t*temp = malloc(sizeof(node_t)); temp->next = NULL; temp->val = val; current->next = temp; } void print_list() { if (head == NULL) { printf("There is no head\n"); return; } node_t*current = head; while (current->next != NULL) { printf("%d \n", current->val); current = current->next; } printf("%d \n", current->val); } int main() { head = malloc(sizeof(node_t)); head->val = 1; head->next = NULL; int n, index, num; while (1) { printf("\ 1.pop_head 2.pop_last 3.pop_index 4.push_head 5.push 6.print_list 7.quit\n"); scanf("%d", &n); switch (n) { case 1: pop_head(); break; case 2: pop_last(); break; case 3: printf("please enter index\n"); scanf("%d", &index); pop_index(index); break; case 4: printf("please enter number for pushing in the linked list\n"); scanf("%d", &num); push_head(num); break; case 5: printf("please enter number for pushing in the linked list\n"); scanf("%d", &num); push(num); break; case 6: print_list(); break; case 7: printf("Bye"); return; break; } printf("\n"); } return 0; }

모든 경우의 수를 다 해본 건 아니지만

기본적인 오류는 다 고쳤다

만약 오류가 난다면 알려주시거나

혼자서 고쳐보시면 좋을 것 같다!