单链表的插入和删除操作

结构体定义：主要包含一个value和一个next指针
插入操作思路：查找尾节点，在尾节点后面插入
删除操作思路：这里的删除，主要是根据你传入的value，然后删除list对应的value节点，删除的时候，记住前面的节点和后面的节点，再链接起来就好了

代码实现

 struct utmp 
 {
     short   ut_type;              
     pid_t   ut_pid;               
     char    ut_line[20]; 
     char    ut_id[4]; 
 }；

struct utmp_list
{
    struct utmp value;    // 根据自己的需要，去定义自己的value属性
    struct utmp_list * next;
};

void list_insert(struct utmp_list * list, struct utmp * value)
{
    if(!list)
        return;

    struct utmp_list *pList = list;

    while(pList->next)
        pList = pList->next;

    struct utmp_list * node = (struct utmp_list *)malloc(sizeof(struct utmp_list));
    if(!node)
    {
        printf("malloc struct utmp_list failed\n");
        return;
    }

    if(value)
        memcpy(&node->value, value, sizeof(struct utmp));
    node->next = NULL;

    pList->next = node;
}

int list_get_ele_and_del(struct utmp_list * list, char * value, struct utmp * retUtmp)
{
    if(!list)
    {
        printf("List is empty, insert error\n");
        return -1;
    }

    struct utmp_list * pList = list;
    struct utmp_list * beforeNode = list;

    while(pList)
    {
        if(0 == strcmp(value, pList->value.ut_line))
        {
            beforeNode->next = pList->next;
            if(retUtmp)
                memcpy(retUtmp, &pList->value, sizeof(struct utmp));
            free(pList);
            return 0;
        }
        else
        {
            beforeNode = pList;
            pList = pList->next;
        }
    }    

    return -1;
}