給定一個帶頭結點的單鏈表,設head爲頭指針
,使其按遞增次序輸出單鏈表中各個結點的數據元素,並釋放結點所佔的存儲空間(要求:不允許使用數組作爲輔助空間)
#include<stdio.h>
#include<stdlib.h>
struct Lnode
{
int data;
Lnode *next;
};
int Init(struct Lnode *L, int i)
{
struct Lnode *p;
struct Lnode *q=L;
int j=0;
while(j<i)
{
p = (struct Lnode *)malloc(sizeof(struct Lnode));
scanf("%d",&(p->data));
p->next =NULL;
q->next = p;
q= p;
j++;
}
return 0;
}
int min_delete(struct Lnode *head)
{
struct Lnode *p,*q,*t;
while(head->next!=NULL)
{
t = head;
q = head->next;
p = q->next;
while(p!=NULL)
{
if(q->data<p->data)
{
int i = q->data;
q->data = p->data;
p->data = i;
t =q;
q = p;
p = p->next;
}
else
{
t = q;
q = p;
p = p->next;
}
}
printf("%d\t",q->data);
free(q);
q = NULL;
t->next = NULL;
}
return 0;
}
int main()
{
struct Lnode Head;
struct Lnode *L=&Head;
L->next = NULL;
int i = 5;
Init(L,i);
min_delete(L);
return 0;
}