IDEA-Dateien ignorieren

test_stack.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include "stack.h"
+
+int main()
+{
+    StackNode *stack = NULL;
+
+    // Test 1: Push
+    int *a = malloc(sizeof(int));  // erstellt Daten
+    *a = 10;
+    int *b = malloc(sizeof(int));
+    *b = 20;
+    int *c = malloc(sizeof(int));
+    *c = 30;
+
+    stack = push(stack, a); //legt ein Element oben auf den Stack
+    stack = push(stack, b);
+    stack = push(stack, c);
+
+    // Test 2: Top
+    printf("Top (soll 30 sein): %d\n", *((int*)top(stack))); // Zeigt den Top vom Stack
+
+    // Test 3: Pop
+    stack = pop(stack);  // entfernt 30
+    free(c);
+
+    printf("Top nach pop (soll 20 sein): %d\n", *(int*)top(stack)); // // Zeigt den Top vom Stack
+
+    // Test 4: Nochmal pop
+    stack = pop(stack);  // entfernt 20
+    free(b);
+
+    printf("Top nach pop (soll 10 sein): %d\n", *(int*)top(stack));
+
+    // Test 5: clearStack
+    clearStack(stack);  //  gibt den gesamten Speicher frei
+
+    return 0;
+}

highscores.txt

@@ -1 +1,8 @@
+the_king;43984
+Regis;18924
+player_name;9929
+Kamto;7946
+player_name;5987
+Warren;4986
 player1;3999
+player_name;2991

stack.c

@@ -10,24 +10,43 @@
 // Pushes data as pointer onto the stack.
 StackNode *push(StackNode *stack, void *data)
 {
-
+StackNode *newNode = (StackNode *)malloc(sizeof(StackNode));
+if(newNode == NULL)
+  return NULL;
+newNode->data = data;
+newNode->next = stack;
+return newNode;
 }
 
 // Deletes the top element of the stack (latest added element) and releases its memory. (Pointer to data has to be
 // freed by caller.)
 StackNode *pop(StackNode *stack)
 {
+    if (stack == NULL)
+        return NULL;
 
+    StackNode *newTop = stack->next;
+    free(stack);
+    return newTop;
 }
 
 // Returns the data of the top element.
 void *top(StackNode *stack)
 {
-
+if (stack == NULL)
+  return NULL;
+return stack->data;
 }
 
 // Clears stack and releases all memory.
 void clearStack(StackNode *stack)
 {
+StackNode *current = stack;
 
+while (current != NULL)
+  {
+  StackNode *next = current->next;
+  free(current);
+  current = next;
+  }
 }

stack.h

@@ -9,6 +9,12 @@ The latest element is taken from the stack. */
 
 //TODO: passenden Datentyp als struct anlegen
 
+
+typedef struct StackNode {
+    void *data;
+    struct StackNode *next;
+} StackNode;
+
 // Pushes data as pointer onto the stack.
 StackNode *push(StackNode *stack, void *data);