add Makefile.

Author: CreatorMetaSky

.devcontainer/Dockerfile

@@ -1,8 +1,5 @@
 FROM --platform=linux/arm64 debian:bullseye-slim
 
-# prepare
-RUN mkdir software
-
 # basic
 RUN apt-get update \
     && apt-get install -y file curl vim

.devcontainer/devcontainer.json

@@ -9,7 +9,8 @@
 	"customizations": {
 		"vscode": {
 			"extensions": [
-				"ms-vscode.cpptools"
+				"ms-vscode.cpptools",
+				"ms-vscode.makefile-tools"
 			],
 			"settings": {
 				"editor.formatOnType": false

Makefile

@@ -0,0 +1,8 @@
+target:
+	gcc -g main.c -o main
+
+ck:
+	valgrind --leak-check=full ./main
+	
+clean:
+	rm -rf main

main.c

@@ -14,6 +14,11 @@
 // 10. delete last kth
 // 11. find middle node
 
+// 12. remove =k elements
+// 13. rotate right
+// 14. get intersection
+// 15. check palinkdrome 12321
+
 typedef struct SinglyLinkedNode {
     int data;
     struct SinglyLinkedNode *next;
@@ -63,6 +68,29 @@ void print_linked_list(SinglyLinkedNode *head) {
     }
 }
 
+void test_create_print_free() {
+    SinglyLinkedNode *head = NULL;
+    append_node(&head, 1);
+    append_node(&head, 2);
+    append_node(&head, 3);
+    append_node(&head, 4);
+
+    print_linked_list(head);
+
+    free_linked_list(head);
+}
+
+void test_insert() {
+    SinglyLinkedNode *head = NULL;
+    insert_node(&head, 3);
+    insert_node(&head, 2);
+    insert_node(&head, 1);
+
+    print_linked_list(head);
+
+    free_linked_list(head);
+}
+
 void reverse(SinglyLinkedNode **head_ref) {
     SinglyLinkedNode *current = *head_ref;
     SinglyLinkedNode *prev_node = NULL;
@@ -77,6 +105,20 @@ void reverse(SinglyLinkedNode **head_ref) {
     }
 }
 
+void test_reverse() {
+    SinglyLinkedNode *head = NULL;
+    append_node(&head, 1);
+    append_node(&head, 2);
+    append_node(&head, 3);
+    print_linked_list(head);
+
+    printf("---\n");
+    reverse(&head);
+    print_linked_list(head);
+
+    free_linked_list(head);
+}
+
 int check_circle(SinglyLinkedNode *head) {
     SinglyLinkedNode *slow, *fast;
     slow = fast = head;
@@ -90,6 +132,21 @@ int check_circle(SinglyLinkedNode *head) {
     return 0;
 }
 
+void test_circle() {
+    SinglyLinkedNode *head = NULL;
+    append_node(&head, 1);
+    append_node(&head, 2);
+    append_node(&head, 3);
+    append_node(&head, 4);
+
+    head->next->next->next->next = head;
+
+    int has_circle = check_circle(head);
+    printf("has circle = %d\n", has_circle);
+
+    free_linked_list(head);
+}
+
 SinglyLinkedNode *find_middle_node(SinglyLinkedNode *head) {
     SinglyLinkedNode *slow, *fast;
     slow = fast = head;
@@ -100,6 +157,20 @@ SinglyLinkedNode *find_middle_node(SinglyLinkedNode *head) {
     return slow;
 }
 
+void test_middle_node() {
+    SinglyLinkedNode *head = NULL;
+    append_node(&head, 1);
+    append_node(&head, 2);
+    append_node(&head, 3);
+    append_node(&head, 4);
+    append_node(&head, 5);
+
+    SinglyLinkedNode *middle_node = find_middle_node(head);
+    printf("middle node value = %d\n", middle_node->data);
+
+    free_linked_list(head);
+}
+
 void delete_last_kth(SinglyLinkedNode **head_ref, int k) {
     // 1. fast move k step
     SinglyLinkedNode *fast = *head_ref;
@@ -127,6 +198,22 @@ void delete_last_kth(SinglyLinkedNode **head_ref, int k) {
     free(slow);
 }
 
+void test_delete_last_kth() {
+    SinglyLinkedNode *head = NULL;
+    append_node(&head, 1);
+    append_node(&head, 2);
+    append_node(&head, 3);
+    append_node(&head, 4);
+    append_node(&head, 5);
+    print_linked_list(head);
+
+    delete_last_kth(&head, 2);
+    print_linked_list(head);
+
+    free_linked_list(head);
+}
+
+
 // 1 3 5 | 2 4 6 -> 3 5 | 2 4 6
 void move_node(SinglyLinkedNode **dest_ref, SinglyLinkedNode **src_head_ref) {
     SinglyLinkedNode *new_node = *src_head_ref;
@@ -159,87 +246,6 @@ SinglyLinkedNode *merge_sorted_linked_list(SinglyLinkedNode *a , SinglyLinkedNod
     return result.next;
 }
 
-void test_create_print_free() {
-    SinglyLinkedNode *head = NULL;
-    append_node(&head, 1);
-    append_node(&head, 2);
-    append_node(&head, 3);
-    append_node(&head, 4);
-
-    print_linked_list(head);
-
-    free_linked_list(head);
-}
-
-void test_insert() {
-    SinglyLinkedNode *head = NULL;
-    insert_node(&head, 3);
-    insert_node(&head, 2);
-    insert_node(&head, 1);
-
-    print_linked_list(head);
-
-    free_linked_list(head);
-}
-
-void test_reverse() {
-    SinglyLinkedNode *head = NULL;
-    append_node(&head, 1);
-    append_node(&head, 2);
-    append_node(&head, 3);
-    print_linked_list(head);
-
-    printf("---\n");
-    reverse(&head);
-    print_linked_list(head);
-
-    free_linked_list(head);
-}
-
-void test_circle() {
-    SinglyLinkedNode *head = NULL;
-    append_node(&head, 1);
-    append_node(&head, 2);
-    append_node(&head, 3);
-    append_node(&head, 4);
-
-    head->next->next->next->next = head;
-
-    int has_circle = check_circle(head);
-    printf("has circle = %d\n", has_circle);
-
-    free_linked_list(head);
-}
-
-void test_middle_node() {
-    SinglyLinkedNode *head = NULL;
-    append_node(&head, 1);
-    append_node(&head, 2);
-    append_node(&head, 3);
-    append_node(&head, 4);
-    append_node(&head, 5);
-
-    SinglyLinkedNode *middle_node = find_middle_node(head);
-    printf("middle node value = %d\n", middle_node->data);
-
-    free_linked_list(head);
-}
-
-void test_delete_last_kth() {
-    SinglyLinkedNode *head = NULL;
-    append_node(&head, 1);
-    append_node(&head, 2);
-    append_node(&head, 3);
-    append_node(&head, 4);
-    append_node(&head, 5);
-    print_linked_list(head);
-
-    delete_last_kth(&head, 2);
-    print_linked_list(head);
-
-    free_linked_list(head);
-}
-
 void test_merge_sorted_linked_list() {
     SinglyLinkedNode *a = NULL;
     append_node(&a, 1);