实现将单链表最大元素放在最前面

typedef struct node{
    int val;
    struct node*next;
}node;
typedef struct list{
    node*first;
    int n;
}list;
node* put(list*head){
    node*min=head->first;
    node*p=head->first;
    node*pre=NULL;
    node*minpre=NULL;
    while(p){
        if(min->val>=p->val){
            minpre=pre;
            min=p;
        }
        pre=p;
        p=p->next;
     }
    minpre->next=min->next;
    min->next=head->first;
    head->first=min;
    return head->first;
   
}