List.c

#include "List.h"
#include <string.h>

void InitList(ListNode_t *head)
{
    head->value = (char *) malloc(sizeof(char));
    strcpy(head->value, "*");
    head->next = NULL;
}

void ListAdd(ListNode_t *head, char *value)
{
    if(strcmp(value, "") == 0) return;
    // if(ListSearch(head, value)) return;

    ListNode_t * current = head;
    while (current->next != NULL) {
        current = current->next;
    }

    current->next = (ListNode_t *) malloc(sizeof(ListNode_t));
    current->next->value = (char *) malloc(sizeof(char) * strlen(value));
    strcpy(current->next->value, value);
    current->next->next = NULL;
}

void ListPrint(ListNode_t *head) 
{
    ListNode_t *current = head;

    while (current != NULL) {
        if (strcmp(current->value, "*") != 0)
            printf("%s\n", current->value);
        current = current->next;
    }
}

int ListSearch(ListNode_t *head, char *value)
{
    ListNode_t *current = head;
    while (current != NULL) {
        if (strcmp(current->value, value) == 0)
        {
            return 1;
        }
            
        current = current->next;
    }

    return 0;
}

int ListContains(ListNode_t *head, char *value)
{
    ListNode_t *current = head;
    while (current != NULL) {
        if (strstr(current->value, value) != NULL)
            return 1;
            
        current = current->next;
    }

    return 0;
}

int ListRemove(ListNode_t *head, char *value)
{
    ListNode_t *current = head, *prev;
    while (current != NULL && strcmp(current->value, value) != 0) {
        prev = current;
        current = current->next;
    }

    if (current == NULL)
        return -1;

    prev->next = current->next;
    free(current->value);
    free(current);

    return 1;
}

ListNode_t *GetItem(ListNode_t *head)
{
    return head->next;
}

int ListIsEmpty(ListNode_t *head) 
{
    return head->next == NULL;
}

void FreeList(ListNode_t *head)
{
    if(head != NULL)
    {
        FreeList(head->next);
        free(head->value);
        free(head);
    }
}