Aktualizovat du4 /snake.c

du4 /snake.c

@@ -16,7 +16,31 @@ struct snake* add_snake(struct snake* snake,int x,int y)
 }
 
 struct snake* remove_snake(struct snake* snake){
-    return NULL;
+
+    struct snake* currentPtr = snake;
+    struct snake* prevPtr;
+    
+    if (snake == NULL)
+    {
+        return NULL;
+    }
+    while (1)
+    {
+        //pomocny pointer -> ulozenie predoslej casti/node-u
+        prevPtr = currentPtr;
+        //skontroluje, ze ci dalsia cast je PRAZDNA.
+        if (currentPtr->next == NULL)
+        {
+            //uprava listu -> odlinkje tuto cast (tak aby prevPtr->next NEFERENCOVAL na uz uvolnenu cast)
+            prevPtr->next = NULL;
+            //uvolni pamat pre akt. cast (uvolni pamat)
+            free(currentPtr);
+            break;
+        }
+        //iteruj ku dalsiej casti (node)
+        currentPtr = currentPtr->next;
+    }
+    return snake;
 }
 
 void free_snake(struct snake* sn)
@@ -25,7 +49,7 @@ void free_snake(struct snake* sn)
     struct snake* currentPtr = sn;
     while (currentPtr != NULL)
     {
-        //uloz dalsiu cast
+        //uloz dalsiu cast, zmaz aktualnu a posun sa na dalsiu
         struct snake* nextPtr = currentPtr->next;
         free(currentPtr);
         currentPtr = nextPtr;
@@ -37,6 +61,7 @@ int is_snake(struct snake* snake,int x,int y){
     //helper pointer/smernikova premena
     struct snake* currentPtr = snake;
     
+    //iteracia cez vsetky casti az dokial nenajdeme cast/node s rovnakymi suradnicami
     while (currentPtr != NULL)
     {
         if (currentPtr->x == x && currentPtr->y == y)