1.输出单链表中最小值
#include<iostream>
using namespace std;
#include<ctime>
#include<cstdlib>
typedef struct Node
{
int data;
struct Node *next;
}Node,*LinkList;
void Init(LinkList &L)
{
L = new Node;
L->next = NULL;
}
void Create(LinkList &L)
{
for(int i=0 ;i<=10;i++)
{
Node *p = new Node;
p->data = rand()%100+1;
p->next = L->next;
L->next = p;
}
}
void MinX(LinkList &L)
{
int min = L->next->data;
Node *p,*q;
p = L->next;
q = p;
while(p)
{
p = p->next;
if(p&&min > p->data)
{
min = p->data;
}
}
cout<<"最小值为: "<<min<<endl;
}
void Print(LinkList &L)
{
Node *p = L->next;
while(p)
{
cout<<p->data<<" ";
p = p->next;
}
}
int main()
{
srand((int)time(0));
LinkList L;
Init(L);//初始化一个单链表
Create(L);//创建一个单链表
Print(L);//打印单链表中的内容
cout<<endl;
MinX(L);//查询单链表中最小的值
}