数据结构例18.将单链表中值最小的那个结点删除

/*
14.试设计一个算法，将单链表中值最小的那个结点删除
*/

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


typedef struct Node
{
	int elem;
	struct Node* next;
}*linklist;

void inlinklist(linklist &l, int n)
{
	l = (linklist) malloc (sizeof(Node));
	l->next = NULL;
	linklist p, end;
	end = l;

	printf("请输入链表中的元素值：\n");
	for(int i = 0; i<n; i++)
	{
		p = (linklist) malloc (sizeof(Node));
		scanf("%d", &p->elem);
		end->next = p;
		p->next = NULL;
		end = p;
	}
}

void outlinklist(linklist l)
{
	printf("链表中的元素为:\n");
	linklist p;
	p = l->next;

	while(p)
	{
		printf("%d ", p->elem);
		p = p->next;
	}
	printf("\n");
}

void deletelinklist(linklist &l)
{
	linklist cur, precur, min, premin;

	cur = min = precur = premin = l;
	cur = l->next;
	min = l->next;

	while(cur != NULL)
	{
		if(cur->elem < min->elem)
		{
			premin = precur;
			min = cur;
		}
		precur = cur;
		cur = cur->next;
	}
	linklist p;
	p = min;
	premin->next = min->next;
	free(p);
}

int main()
{
	linklist l;
	int n;

	printf("请输入链表的元素个数：\n");
	scanf("%d", &n);

	inlinklist(l, n);
	deletelinklist(l);
	outlinklist(l);

	return 0;
}