链表的基本操作要不经大脑思考直接写出
#include<bits/stdc++.h>
using namespace std;
typedef struct Node {
int data;
Node *next;
}*LinkList;
void creatList(LinkList l1, int length);
int main() {
LinkList l1 = new Node;
LinkList n=l1;
l1->data = -1;
l1->next = NULL;//头节点
creatList(l1, 4);//创建链表
while (n->next) {
n = n->next;
cout<<n->data<<endl;
}
delete l1;
return 0;
}
//创建链表
void creatList(LinkList l1, int length) {
int i = 0;//记录链表长度
LinkList p1, p2;
p1 = p2 = l1;
while (i < length) {
p1 = new Node;//创建一个节点
p1->data = i+1;
p2->next = p1;//节点的移动
p2 = p1;
i++;
}
p2->next = NULL;
}