题目:
代码:
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
list<int>ls1;
//struct Node{
//
//};
int main()
{
auto p_ls1=ls1.begin();
int n=0;
cin>>n;
int i=0,num_tem=0;
while(i<n)
{
i++;
cin>> num_tem;
ls1.push_front(num_tem);
}
// auto p_ls1=ls1.begin();
// for(int& j:ls1)
// {
// cout<<(*(p_ls1++))<<" ";
// }
int m=0;
cin>>m;
i=0;
num_tem=0;
string oper;
int the_XXth=0;
while(i<m)
{
i++;//共m行指令
cin>>oper;
if(oper=="show"){
p_ls1=ls1.begin();
cout<<"showing:"<<endl;
for(int& j:ls1)
{
cout<<j<<" ";
}
cout<<endl;
}
else if(oper=="delete"){
p_ls1=ls1.begin();
cin>>the_XXth;
cout<<"deleteing"<<endl;
for(int p=1;p<the_XXth;p++)
{
p_ls1++;
}
ls1.erase(p_ls1);
}
else if(oper=="insert"){
}
else if(oper=="get"){
}
}
return 0;
}
log:
- 我的结构体list也许可以改用set来简化??
- 卡住了:
- 换成erase就好了,可能是逻辑乱了
- 实验代码: