单链表操作

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <conio.h>
using namespace std;

typedef struct student
{
	int data;
	struct student *next;
}node;

node *creat()
{
	node *head, *p, *s;
	int data, cycle = 1;
	head = (node*)malloc(sizeof(node));
	p = head;
	while(cycle)
	{
		cout<<"please input the data:"<<endl;
		cin >>data;
		if(data != 0)
		{
			s = (node *)malloc(sizeof(node));
			s->data = data;
			//cout<<s->data<<endl;
			p->next =s;
			p = s;
		}
		else
			cycle = 0;
	}
	head = head->next;
	p->next = NULL;
	return(head);
}
//测长度
int  length(node* head)
{
	node *p;
	int count = 0;
	p = head;
	while(p != NULL)
	{
		p = p->next;
		count++;
	}
	return count;
}
//print
void print(node *head)
{
	node *p;
	p = head;
	while(p !=NULL)
	{
		cout<<p->data<<" ,";
		p = p->next;
	}
}

//delete node
node * del(node *head)
{
	node *p1, *p2;
	int num=0;
	p1 = head;
	
	cout<<endl<<"Delete:"<<endl;
	cin>>num;
	while(num != p1->data && p1->next != NULL)
	{
		p2 = p1;
		p1 = p1->next;
	}
	if(num == p1 ->data)
	{
		if(p1 == head)
		{
			head = p1 ->next;
			free(p1);
		}
		else
		{
			p2 ->next = p1 ->next;
		}
		cout <<"Delete Success!"<<endl;
	}
	else
		cout<<"Can not found!"<<endl;
	return (head);
}
//insert
node *insert(node *head, int num)
{
	node *p1, *p2, *p0;
	p1 = head;
	p0 = (node *)malloc(sizeof(node));
	p0 ->data = num;
	
	while(p0 ->data > p1 ->data && p1->next != NULL)
	{
		p2 = p1;
		p1 = p1 ->next;
	}

	if(p0 ->data <= p1 ->data)
	{
		if (p1 == head)
		{
			p0 ->next =p1;
			head = p0;
		}
		else
		{
			p2 ->next = p0;
			p0 ->next = p1;
		}
	}
	else
	{
		p1->next = p0;
		p0 ->next = NULL;
	}
	return (head);
}

node *sort(node *head)
{
	node *p;
	int n, temp;
	n = length(head);
	if(head == NULL || head->next == NULL)
	{
		return head;
	}
	p = head;
	for(int j = 1; j<n; ++j)
	{
		p = head;//每次从头再来
		for(int i=0; i<n-j; ++i)
		{
			if(p->data > p->next->data)
			{
				temp = p->data;
				p->data = p->next->data;
				p->next->data = temp;
			}
			p = p->next;
		}
	}
	return head;
}
//逆序
node * reverse(node *head)
{
	node *p1, *p2, *p3;
	if(head == NULL || head->next ==NULL)
		return head;
	p1 = head;
	p2 = p1->next ;
	while(p2)
	{
		p3 = p2->next;
		p2 ->next = p1;
		p1 = p2;
		p2 = p3;
	}
	head ->next = NULL;
	head = p1;
	return head;
}
int main(int argc, char* argv[])
{
	node *head;
	head = creat();
	cout <<"The length of the linktalbe is: "<<length(head)<<endl;
	print(head);
	del(head);

	head= sort(head);
	cout <<endl<<"After sort:"<<endl;
	print(head);

	head =reverse(head);
	cout <<endl<<"After reverse:"<<endl;
	print(head);
	return 0;
}