C++删除以L为首节点指针的单链表中值为x的所有节点

题目：

删除以L为首节点指针的单链表中值为x的所有节点

实现代码：

#include<iostream>
using namespace std;
typedef int ElemType;

struct term					
{
	int data;
	term* next;
};

struct Array			
{
	term* first;

	Array() { first = (term*)malloc(sizeof(term)); first->next = NULL; };
	Array(Array& a);
	Array(ElemType* a, int n);
	~Array();
};

Array::Array(Array& a)
{
	first = (term*)malloc(sizeof(term));							
	term* s, * r = this->first, * p;
	for (p = a.first->next; p != NULL; p = p->next)
	{
		s = (term*)malloc(sizeof(term));
		s->data = p->data;
		r->next = s;
		r = s;
	}
	r->next = NULL;
}

Array::Array(ElemType* a, int n)
{
	term* s, * r;
	first = (term*)malloc(sizeof(term));
	first->next = NULL;
	for (n--; n >= 0; n--)
	{
		s = (term*)malloc(sizeof(term));
		s->data = a[n];
		s->next = first->next;
		first->next = s;
	}
}

Array::~Array()
{
	term* pre = first, * p = first->next;
	for (; p != NULL; p = pre->next)
	{
		free(pre);
		pre = p;
	}
	free(pre);
}

ostream& operator<<(ostream& o, const Array& a)
{
	term* p = a.first->next;
	for (; p != NULL; p = p->next)
		cout << p->data << "  ";
	return o;
}

bool Delete(term*& p, ElemType x)
{
	if (p == NULL)
		return false;
	else if (p->data == x)
	{
		term* t;
		t = p;
		p = p->next;
		free(t);
		return Delete(p, x);
	}
	else
		return Delete(p->next, x);
}

void ListDelete(Array& p, ElemType x)
{
	term*& L = p.first;
	Delete(L, x);
}

int main()
{
	ElemType a[10] = {3,4,4,2,7,6,7,8,9,2 };
	Array p(a, 10);
	cout<<"删除前："<<p<<endl;
	ListDelete(p, 7);
	cout << "删除后:" << p << endl;
}