#include <bits/stdc++.h>
using namespace std;
struct node{
int id;
node *nid;
};
void insert(int ele,node *head,int index){
node *now,*p;
while(index--){
now=head;
head=head->nid;
}
p=new node;
p->id=ele;
p->nid=head;
now->nid=p;
}
void select(node *head,int index){
node *now,*p;
while(index--){
now=head;
head=head->nid;
}
now->nid=head->nid;
}
int main() {
node *head,*now,*p;
head=new node;
now=head;
p=new node;
p->id=1;
p->nid=NULL;
head->nid=p;
now=head->nid;
}
指针链表自学
最新推荐文章于 2024-07-17 23:24:38 发布