静态链表实现A-B（集合相减操作）

#include <iostream>
using namespace std;
#define Elemtype int
#define MAX_SIZE 100
#include<vector>
using namespace std;
typedef struct
{
Elemtype data;
int cur;
}node,nodes[100];
void init_nodes(nodes& nodes)
{
for (int i = 0; i < MAX_SIZE-1; i++)
{
nodes[i].cur = i + 1;
}
nodes[MAX_SIZE - 1].cur = 0;
}
int node_malloc(nodes& nodes)
{
int give = nodes[0].cur;
nodes[0].cur = nodes[give].cur;
return give;
}
void free_node(nodes& nodes, int j)
{
nodes[j].cur = nodes[0].cur;
nodes[0].cur = j;
}
void difference(int& data,nodes& nodes,vector<int> a,vector<int> b)
{
int n = node_malloc(nodes);
nodes[n].cur = 0;
int p = n;
//int temp = node_malloc(nodes);
//nodes[n].cur = temp;
for (int i = 0; i < a.size(); i++)
{
int temp = node_malloc(nodes);
nodes[temp].data = a[i];
nodes[p].cur = temp;
p = temp;
}
nodes[p].cur = 0;
int t = p;//t是尾节点

for (int i = 0; i < b.size(); i++)
{
int bj = n;//bj此处是数据链的头结点
p = nodes[n].cur;//p是数据链中的第一个节点
while (p != nodes[t].cur && nodes[p].data != b[i])
{
bj = p;//bj此处是数据链表中与b[i]相等的元素的前一个节点
p = nodes[p].cur;
}
if (p == 0)
{
int s=node_malloc(nodes);
nodes[s].data = b[i];
nodes[t].cur = s;
t = s;
nodes[t].cur = 0;
}
else
{
nodes[bj].cur = nodes[p].cur;
free_node(nodes, p);
}
}
data = n;
}
int main()
{
nodes nodes;
init_nodes(nodes);
vector<int> a;
vector<int>b;
int nums;
int temp;
int data;
cout << "nums of a" << endl;
cin >> nums;
cout << "input a" << endl;
for (int i = 0; i < nums; i++)
{
cin >> temp;
a.push_back(temp);
}
cout << "nums of b" << endl;
cin >> nums;
cout << "input b" << endl;
for (int i = 0; i < nums; i++)
{
cin >> temp;
b.push_back(temp);
}
difference(data,nodes, a, b);
data = nodes[data].cur;
while (data != 0)
{
cout << nodes[data].data<<' ';
data=nodes[data].cur;
}
return 0;
}