C函数检查元素是否为链表的成员(如果为真，则返回0；如果为假，则返回1)

#include <stdio.h>
#include <stdlib.h>

// 定义链表节点结构体
typedef struct Node {
    int data;
    struct Node* next;
} Node;

// 检查元素是否为链表的成员
int isMember(Node* head, int element) {
    Node* current = head;

    // 遍历链表，查找元素
    while (current != NULL) {
        if (current->data == element) {
            return 0; // 元素为链表的成员，返回0
        }
        current = current->next;
    }

    return 1; // 元素不是链表的成员，返回1
}

// 创建链表
Node* createLinkedList(int elements[], int size) {
    Node* head = NULL;
    Node* current = NULL;

    for (int i = 0; i < size; i++) {
        Node* newNode = (Node*)malloc(sizeof(Node));
        newNode->data = elements[i];
        newNode->next = NULL;

        if (head == NULL) {
            head = newNode;
            current = newNode;
        } else {
            current->next = newNode;
            current = newNode;
        }
    }

    return head;
}

// 打印链表
void printLinkedList(Node* head) {
    Node* current = head;

    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }

    printf("\n");
}

int main() {
    int elements[] = {1, 2, 3, 4, 5};
    int size = sizeof(elements) / sizeof(elements[0]);

    Node* head = createLinkedList(elements, size);
    printLinkedList(head);

    int element = 3;
    int result = isMember(head, element);

    if (result == 0) {
        printf("%d is a member of the linked list.\n", element);
    } else {
        printf("%d is not a member of the linked list.\n", element);
    }

    return 0;
}