【数据结构】-线性表-顺序表 熟练度max=2

找出链表中最小值

输入1,2,5,7,9,3,4,5

输出1

#include<stdio.h>
#include<stdlib.h>
typedef struct LNode
{
    int data;
    struct LNode *next;
}LNode;

void saveLNodehead(LNode *&L,int x[])
{
    L = (LNode *)malloc (sizeof(LNode));
    L->next = NULL;

    LNode *q,*s;
    q=L;
    for(int i=0;i<=9;i++)
    {
        s=(LNode * )malloc(sizeof(LNode));
        s->data = x[i];

        q->next=s;
        q=q->next;
    }
    q->next=NULL;
}
int findmin (LNode *L)
{
    LNode *q;
    q=L;
    q=q->next;
    int minn=2222;
    while(q!=NULL)
    {
        if(minn>q->data)
        {
            minn=q->data;
        }
        q=q->next;
    }
    return minn;
}
int main (void)
{
    LNode *L;


    int x[10]={1,2,5,7,9,3,4,5};
    saveLNodehead(L,x);
    printf("%d\n",findmin(L));
}

原文地址：https://www.jb51.cc/datastructure/382357.html