链表实现对员工进行信息管理

最新推荐文章于 2024-10-17 21:05:59 发布

小马过河看小牛试刀

最新推荐文章于 2024-10-17 21:05:59 发布

阅读量785

点赞数 1

分类专栏：数据结构文章标签： c++ 链表

本文链接：https://blog.csdn.net/weixin_45835720/article/details/123624691

版权

数据结构专栏收录该内容

8 篇文章 6 订阅

订阅专栏

头文件：（define.h）

#ifndef DEFINE_H_INCLUDED
#define DEFINE_H_INCLUDED
#include <stdio.h>
#include <stdlib.h>
#include<malloc.h>

#define MaxSize 50


typedef struct LNode{
    char position[20];
    char number[20];
    char name[20];
    char date[20];
    char level[5];
    int salary;

    struct LNode *next;
}LinkNode;

typedef LinkNode ElemType;

void CreateListF(LinkNode *&L,ElemType a[],int n);
void ListInsert(LinkNode *&L,int i);
bool ListEmpty(LinkNode *L);
void DispList(LinkNode *L);
void average(LinkNode *&L);


#endif // DEFINE_H_INCLUDED

函数文件：（define function.cpp）

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include "define.h"



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

void ListInsert(LinkNode *&L,int i)
{
    int j=0;
    LinkNode *p=L,*e;
    if (i<=0) printf("false");
    while(j<i-1&&p!=NULL)
    {
        j++;
        p=p->next;
    }
    if(p==NULL)
        printf("false");
    else
    {
        e=(LinkNode *)malloc(sizeof(LinkNode));
        scanf("%s %s %s %s %s %d",e->position,e->number,e->name,e->date,e->level,e->salary);
        e->next=p->next;
        p->next=e;
    }
}

bool ListEmpty(LinkNode *L)
{
    return(L->next==NULL);
}

void DispList(LinkNode *L)
{
    int n;
    LinkNode *p=L->next;
    printf("员工列表为:\n");
    while(p!=NULL)
    {
        printf("%s %s %s %s %s %d",p->position,p->number,p->name,p->date,p->level,p->salary);
        printf("\n");
        p=p->next;
    }
}

void average(LinkNode *&L)
{
    int n=0;
    int sum=0;
    int average=0;
    LinkNode *p=L->next;
    while(p!=NULL)
    {
        sum=sum+(p->salary);
        p=p->next;
        n++;
    }
    average=sum/n;
    printf("员工平均工资为：%d",average);
    printf("\n");
}

main函数：（main.cpp）

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include "define.h"



int main()
{
    LinkNode *L;
    int k;
    struct LNode info[5]={
    {"董事长","WL001","表姐","2007/11/19","A5",10000},
    {"总经理","WL002","凌祯","2011/11/1","A4",9000},
    {"董事长秘书","WL003","邹新文","2005/1/31","A3",8500},
    {"秘书","WL004","李明","2012/6/9","B6",7000},
    {"秘书","WL005","翁国栋","2005/10/30","B1",5000},
    };
    CreateListF(L,info,5);
    DispList(L);
    average(L);
    printf("请输入插入位置：");
    scanf("%d",&k);
    ListInsert(L,k);
    printf("123");
    DispList(L);
}