学习版

【C语言】

【C++】

#include <iostream>

class MyLinkedList{
	
public:
	
	struct LinkedNode{
		int val;
		LinkedNode* next;
		LinkedNode(int x):val(x),next(NULL){};
	};	
	
	MyLinkedList(){
		dummyHead=new LinkedNode(0);
		length=0;
	}
	
	~MyLinkedList(){
		while (dummyHead){
			LinkedNode* tmp=dummyHead;
			dummyHead=dummyHead->next;
			delete tmp;
		}
	}
	
	
	void AddTail(int value){
		LinkedNode* newnode=new LinkedNode(value);
		LinkedNode* cur=dummyHead;
		while (cur->next!=NULL){
			cur=cur->next;
		}
		cur->next=newnode;
		length++;
	}
	bool Is_Legal(int index){
		if (index<2||index>length){
			return false;
		}
		else return true;
	}
	void DeleteAtIndex(int index){
		LinkedNode* cur=dummyHead;
		index-=2;
		while (index--){
			cur=cur->next;
		}
		LinkedNode* tmp=cur->next;
		cur->next=cur->next->next;
		delete tmp;
		tmp=NULL;
		length--;
	}
	void PrintLinkedList(){
		LinkedNode* cur=dummyHead;
		while (cur->next!=NULL){
			std::cout<<cur->next->val<<" ";
			cur=cur->next;
		}
	}
private:
	LinkedNode* dummyHead;
	int length;	
};
int main() {
	MyLinkedList list;
	int n,a;
	std::cin>>n;
	while (n--){
		std::cin>>a;
		list.AddTail(a);
	}
	int i;
	std::cin>>i;
	if (list.Is_Legal(i)){
		list.DeleteAtIndex(i);
		list.PrintLinkedList();
	}
	else std::cout<<"error!";
	return 0;
}

【STL】

#include<iostream>
#include<vector>
#include<algorithm>

int main() {
	int n;
	std::cin >> n;
	std::vector<int> vec(n);
	for (int i = 0; i < n; i++) std::cin >> vec[i];
	int i;
	std::cin >> i;
	if (i >= 2 && i <= n) {
		vec.erase(vec.begin() + i - 2);
		for (int a : vec) {
			std::cout << a << " ";
		}
	}
	else std::cout << "error!";
	return 0;
}