2203: 最小节点(线性表)

#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std;
#define MAXN 110
typedef int ElemType;
typedef struct LNode
{
    ElemType data;
    struct LNode * next;
}LinkNode;

ElemType a[MAXN], e;
LinkNode *L;

void CreateList(LinkNode *&L, ElemType a[], int n)
{
    LinkNode *r, *s;
    L = (LinkNode *)malloc(sizeof(LinkNode));
    r = L;
    for(int i = 0; i < n; ++i)
    {
        s = (LinkNode *)malloc(sizeof(LinkNode));
        s->data = a[i];
        r->next = s;
        r = s;
    }
    r->next = NULL;
}

void GetMin(LinkNode *L, ElemType &e)
{
    LinkNode *p = L->next, *pre = L, *minp, *minpre;
    minp = p;
    minpre = pre;
    while(p != NULL)
    {
        if(minp->data > p->data)
        {
            minp = p;
            minpre = pre;
        }
        pre = p;
        p = p->next;
    }
    e = minp->data;
    return ;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    CreateList(L, a, n);
    GetMin(L, e);
    cout << e << endl;
    return 0;
}