#include<bits/stdc++.h>
using namespace std;
const int SIZE=100;
int q;
struct Node{
int value;
int prev ,next;
}node[SIZE];
int head,tail,tot;
int initialize()//初始化链表
{
tot = 2;
head = 1,tail = 2;
node[head].next = tail;
node[tail].prev = head;
}
int insert(int p,int val)//在p后插入值为val的节点
{
q = ++tot;
node[q].value = val;
node[node[p].next].prev = q;
node[q].next = node[p].next;
node[p].next = q;
node[q].prev = p;
}
void remove (int p)//删除p
{
node[node[p].prev].next = node[p].next;
node[node[p].next].prev = node[p].prev;
}
void clear()//清空
{
memset(node,0,sizeof(node));
head = tail = tot =0;
}
int main()
{
}
使用数组模拟链表
最新推荐文章于 2024-05-02 20:17:52 发布