#include "stdafx.h"
#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
typedef int type;
typedef struct lnode //定义链表结点的数据结构
{
int data;
struct lnode *next;
}Lnode;
typedef Lnode node;
typedef struct dnode//定义双链表结点的数据结构
{
int data;
struct dnode *lnext;
struct dnode *rnext;
}Dnode;
void delcirminest19(node *h)
{
//一边寻找最小值一边进行删除这样写时间代价仿佛太大;
int min;
node *q=h->next;
while (q!=h)
{
min = q->data;
node *p = q->next;
while (p != h){
if (p->data < min)
min = p->data;
p = p->next;
}
while (p->next != h)
{
if (p->next->data == min)
{
printf("删除:%d\n", p->next->data);
p->next = p->next->next;
}
p = p->next;
}
q= h->next;
}
}