【数组，链表】

数组

#include<iostream>
using namespace std;

int* initialize(int size) {
	int* arr = new int[size];
	for (int i = 0; i < size; i++)
		arr[i] = i;
	return arr;
}

int access(int*arr,int index) {
	return arr[index];
}

int* insert(int* arr, int size,int index,int value) {
	int* newArr = new int[size + 1];
	for (int i = 0; i < index; i++)
		newArr[i] = arr[i];
	newArr[index] = value;
	for (int i = index; i < size; i++)
		newArr[i + 1] = arr[i];
	return newArr;
}

int* remove(int* arr, int size, int index) {
	for (int i = index; i < size-1; i++) {
		arr[i] = arr[i + 1];
	}
	return arr;
}

int find(int* arr, int size, int target) {
	for (int i = 0; i < size; i++) {
		if (arr[i] == target)
			return i;
	}
	return -1;
}

void print(int* arr, int size) {
	for (int i = 0; i < size; i++)
		cout << arr[i] << " ";
	cout << endl;
}

int main() {
	int* a = initialize(5);
	print(a,5);
}

链表

#include<iostream>
using namespace std;

struct Node {
	int val;
	Node* next;
	Node(int x):val(x),next(nullptr){}
};

// 初始化链表
Node* initialize(int array[],int size) {
	Node* head = new Node(array[0]);
	Node* f = head;
	for (int i = 1; i < size; i++) {
		Node* b = new Node(array[i]);
		f->next = b;
		f = b;
	}
	return head;
}

// 向后插入节点
void insert(Node* f, Node* newNode) {
	// 如果f恰好是最后一个节点
	if (f->next == nullptr) {
		f->next = newNode;
	}
	// 如果f不是最后一个节点
	else {
		Node* b = f->next;
		f->next = newNode;
		newNode->next = b;
	}
}

// 删除f之后的节点
void remove(Node* f) {
	if (f->next == nullptr) {
		return;
	}
	else if (f->next->next == nullptr) {
		delete f->next;
	}
	else {
		Node* d = f->next;
		Node* b = d->next;
		f->next = b;
		delete d;
	}
}

// 访问节点
Node* access(Node* head, int index) {
	for (int i = 0; i < index; i++) {
		if (head == nullptr)
			return nullptr;
		head = head->next;
	}
	return head;
}

// 查找结点
int find(Node* head, int target) {
	int index = 0;
	while (head != nullptr) {
		if (head->val == target)
			return index;
		head = head->next;
		index++;
	}
	return -1;
}

// 遍历链表
void print(Node* head) {
	while (head != nullptr) {
		cout << head->val << " ";
		head = head->next;
	}
	cout << endl;
}

int main() {
	int intArray[5] = { 1,2,3,4,5 };
	Node* head=initialize(intArray, 5);
	print(head);
}