数据结构课后练习——初识单链表（单链表的创建，查找并删除）

就保平布置的那个必做题。。。

题目：在一个按值递增的链表中删除值等于x的节点，成功返回1，失败返回0.

源代码如下：

#include<iostream>
#include<stdlib.h>
using namespace std;
class node {
	node* next;
	int data;
public:
	node() {}
	~node() {}
	node* create();
	int del(node* head);
};

node* node::create()
{
	node *p, *pa, *head;
	head = new node;
	head->next = NULL;
	pa = head;
	int n;
	cout << "输入总个数：";
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		p = new node;
		int a;
		cin >> a;
		p->data = a;
		p->next = NULL;
		pa->next = p;
		pa = p;
	}
	return head;
}

int node::del(node* head)
{
	int n;
	cout << "查找是否存在该数，并删除：";
	cin >> n;
	int x=0;
	node* p = head->next;
	node* pa = head;
	while (p != NULL)
	{
		if (p->data == n)
		{
			x = 1;
			pa->next = p->next;
			delete(p);
			p = pa->next;
		}
		else
		{
			pa = p;
			p = p->next;
		}
	}
	return x;
}

int main(void)
{
	node A;
	node* L = A.create();
	cout<<A.del(L)<<endl;
	system("pause");
	return 0;
}