单链表的插入和删除，visual studio代码实现

在Visual Studio Code中编写单链表的插入和删除操作通常会涉及C++或类似的语言。下面是一个简单的C++示例：

#include <iostream>

// 定义单链表节点
struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

// 插入节点函数
ListNode* insertNode(ListNode* head, int val, int position) {
    if (position <= 0) return new ListNode(val); // 如果插入位置不合理，插入到头部

    ListNode* newNode = new ListNode(val);
    ListNode* current = head;
    for (int i = 1; i < position && current != NULL; ++i) {
        current = current->next;
    }
    if (current == NULL) return head; // 插入到了尾部

    newNode->next = current->next;
    current->next = newNode;
    return head;
}

// 删除节点函数
ListNode* deleteNode(ListNode* head, int val) {
    if (head == NULL || head->val == val) { // 如果链表为空或头节点就是要删除的
        ListNode* temp = head;
        head = head->next;
        delete temp;
        return head;
    }

    ListNode* prev = head;
    ListNode* curr = head->next;
    while (curr != NULL && curr->val != val) {
        prev = curr;
        curr = curr->next;
    }

    if (curr == NULL) return head; // 没有找到要删除的节点

    prev->next = curr->next;
    delete curr;
    return head;
}

// 主函数测试
void test() {
    ListNode* head = new ListNode(1);
    head->next = new ListNode(2);
    head->next->next = new ListNode(3);

    std::cout << "After inserting 0 at position 1: ";
    head = insertNode(head, 0, 1);
    printList(head);

    std::cout << "\nAfter deleting 2: ";
    head = deleteNode(head, 2);
    printList(head);
}

// 打印链表
void printList(ListNode* head) {
    while (head != NULL) {
        std::cout << head->val << " -> ";
        head = head->next;
    }
    std::cout << "NULL" << std::endl;
}

int main() {
    test();
    return 0;
}

这个示例包含了插入和删除功能，以及一个简单的打印链表函数。`insertNode`负责在给定位置插入节点，`deleteNode`负责删除值为`val`的节点。`test`函数用于测试这两个操作。