是否在c++中数组中间插入最后一个元素？

#include <iostream>
#include <vector>

int main() {
    std::vector<int> vec = {1, 2, 3, 4, 5};
    int newElement = 6;

    // 在索引 2 的位置插入新元素
    vec.insert(vec.begin() + 2, newElement);

    // 输出结果
    for (int num : vec) {
        std::cout << num << " ";
    }
    return 0;
}

1 2 6 3 4 5

#include <iostream>

void insertElement(int arr[], int size, int index, int newElement) {
    // 创建一个临时数组
    int temp[size + 1];

    // 复制前半部分元素
    for (int i = 0; i < index; ++i) {
        temp[i] = arr[i];
    }

    // 插入新元素
    temp[index] = newElement;

    // 复制后半部分元素
    for (int i = index; i < size; ++i) {
        temp[i + 1] = arr[i];
    }

    // 将临时数组复制回原数组
    for (int i = 0; i < size + 1; ++i) {
        arr[i] = temp[i];
    }
}

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

    insertElement(arr, size, index, newElement);

    // 输出结果
    for (int i = 0; i < size + 1; ++i) {
        std::cout << arr[i] << " ";
    }
    return 0;
}

1 2 6 3 4 5

#include <iostream>

struct Node {
    int data;
    Node* next;
};

void insertNode(Node*& head, int index, int newElement) {
    Node* newNode = new Node{newElement, nullptr};

    if (index == 0) {
        newNode->next = head;
        head = newNode;
        return;
    }

    Node* current = head;
    for (int i = 0; i < index - 1 && current != nullptr; ++i) {
        current = current->next;
    }

    if (current != nullptr) {
        newNode->next = current->next;
        current->next = newNode;
    }
}

void printList(Node* head) {
    Node* current = head;
    while (current != nullptr) {
        std::cout << current->data << " ";
        current = current->next;
    }
    std::cout << std::endl;
}

int main() {
    Node* head = new Node{1, new Node{2, new Node{3, new Node{4, new Node{5, nullptr}}}}};
    int newElement = 6;
    int index = 2;

    insertNode(head, index, newElement);

    printList(head);
    return 0;
}

1 2 6 3 4 5