用C语言编写程序：通过键盘读取元素建立一个单链表；指定一个元素，在此元素之前插入一个新元素；指定一个元素，删除此元素

在C语言中，我们可以使用stdio.h库来进行键盘输入，malloc函数进行动态内存分配，以及定义链表节点结构来实现所需的功能。首先，让我们定义一个简单的链表节点结构：

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

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

// 创建链表
Node* createList() {
    Node* head = NULL;
    int input;

    printf("请输入元素，按回车结束：");
    while (scanf("%d", &amp;input) == 1) {
        Node* newNode = (Node*)malloc(sizeof(Node));
        newNode->data = input;
        newNode->next = head;
        head = newNode;
    }
    return head;
}

// 在指定元素之前插入新元素
void insertBefore(Node** head, int targetValue, int newValue) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = newValue;

    if (*head == NULL) {
        newNode->next = *head;
        *head = newNode;
        return;
    }

    Node* current = *head;
    while (current->data != targetValue &amp;&amp; current->next != NULL) {
        current = current->next;
    }

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

// 删除指定元素
void deleteElement(Node** head, int targetValue) {
    if (*head == NULL) return;

    if ((*head)->data == targetValue) {
        Node* temp = *head;
        *head = (*head)->next;
        free(temp);
        return;
    }

    Node* current = *head;
    Node* previous = NULL;

    while (current != NULL &amp;&amp; current->data != targetValue) {
        previous = current;
        current = current->next;
    }

    if (current != NULL) {
        previous->next = current->next;
        free(current);
    }
}

int main() {
    Node* list = createList();
    if (list == NULL) {
        printf("无法创建链表.\n");
        return 1;
    }

    printf("\n当前链表: ");
    Node* temp = list;
    while (temp != NULL) {
        printf("%d -> ", temp->data);
        temp = temp->next;
    }
    printf("NULL\n");

    int target = 0; // 假设你想在这个元素之前插入或删除
    int newValue = 5; // 新插入的值

    printf("要在哪个元素前插入新值?\n");
    scanf("%d", &amp;target);

    insertBefore(&amp;list, target, newValue);
    printf("插入新元素后的链表: ");
    temp = list;
    while (temp != NULL) {
        printf("%d -> ", temp->data);
        temp = temp->next;
    }
    printf("NULL\n");

    printf("要删除哪个元素?\n");
    scanf("%d", &amp;target);

    deleteElement(&amp;list, target);
    printf("删除元素后的链表: ");
    temp = list;
    while (temp != NULL) {
        printf("%d -> ", temp->data);
        temp = temp->next;
    }
    printf("NULL\n");

    return 0;
}