C++實現(xiàn)簡單的職工管理系統(tǒng)實訓(xùn)代碼
本文實例為大家分享了C++職工管理系統(tǒng)實例代碼
1.單個職工的頭文件
staff.h
#ifndef STAFF_H_INCLUDED #define STAFF_H_INCLUDED //結(jié)構(gòu)體創(chuàng)建 struct staff { char ID[10]; char name[10]; char sex[10]; int pay; int reward; int factpay; }; //自定義結(jié)構(gòu)體 typedef struct staff staff; //單個職工信息創(chuàng)建 staff Createstaff(); //單個職工信息輸出 void Displaystaff(staff staff); //修改職工信息 void updatestaff(staff *Staff); #endif // STAFF_H_INCLUDED 單個職工的cpp文件 staff.cpp #include <stdio.h> #include <stdlib.h> #include "staff.h" staff Createstaff() { staff staff; printf("-----------ID-----------\n"); scanf("%s", staff.ID); printf("-----------name-----------\n"); scanf("%s", staff.name); printf("-----------sex-----------\n"); scanf("%s", staff.sex); printf("-----------pay-----------\n"); scanf("%d", &staff.pay); printf("-----------reward-----------\n"); scanf("%d", &staff.reward); staff.factpay = staff.pay + staff.reward; printf("\n"); return staff; } void Displaystaff(staff staff) { printf("%10s", staff.ID); printf("%10s", staff.name); printf("%10s", staff.sex); printf("%10d", staff.pay); printf("%10d", staff.reward); printf("%10d", staff.factpay); printf("\n"); } void updatestaff(staff *Staff) { printf("-----請顯示要修改的數(shù)據(jù)--------\n"); Displaystaff(*Staff); printf("-------請輸入要修改的數(shù)據(jù)---------"); printf("-----------pay-----------\n"); scanf("%d", &Staff->pay); printf("-----------reward-----------\n"); scanf("%d", &Staff->reward); Staff->factpay = Staff->pay + Staff->reward; printf("\n"); }
2.鏈表的創(chuàng)建
鏈表的頭文件
linklist.h
#ifndef LINKLIST_H_INCLUDED #define LINKLIST_H_INCLUDED #include "staff.h" //鏈表結(jié)點創(chuàng)建 struct Node { struct staff Staff; struct Node *next; }; //自定義結(jié)點 typedef struct Node node; typedef struct Node *linklist; //創(chuàng)建鏈表 node *Createlinklist(); //輸出鏈表中的數(shù)據(jù) void Displaylinklist(node *head); //按職工號查找職工 node *searchnode(node *head, char ID[]); //按姓名查找職工 void searchnodebyname(node *head, char name[]); //刪除職工 void delenode(linklist head, char ID[]); //插入職工 void insertnode(linklist head, staff Staff); //鏈表銷毀 void distroylinklist(linklist head); #endif // LINKLIST_H_INCLUDED
鏈表創(chuàng)建的源程序
linklist.cpp
#include <stdio.h> #include <stdlib.h> #include <string.h> #include "staff.h" #include "linklist.h" node *Createlinklist() { node *head, *p; head = (node *)malloc(sizeof(node)); head->next = NULL; staff a[100] = {{"11111", "mmm", "f", 12000, 2000, 14000}, {"22222", "aaa", "m", 13000, 3000, 16000}, {"33333", "sss", "f", 15000, 3000, 18000}, {"44444", "fff", "m", 17000, 8000, 25000}, {"55555", "ggg", "f", 20000, 5000, 25000}}; for(int i = 0; i<5; i++) { p = (node *)malloc(sizeof(node)); p->Staff = a[i]; p->next = head->next; head->next = p; } return head; } void Displaylinklist(node *head) { linklist p; p = head->next; while(p!=NULL) { Displaystaff(p->Staff); p = p->next; } } node *searchnode(node *head, char ID[]) { linklist p; p = head; while(p!=NULL&&strcmp(p->next->Staff.ID, ID)!=0) { p = p->next; } return p->next; } void searchnodebyname(node *head, char name[]) { linklist p; p = head; while((p!=NULL)&&(strcmp((p->next)->Staff.name, name)!=0)) { p = p->next; } printf("-----´ËÈËΪ---------\n"); printf("%s", p->next->Staff.name); printf("\n"); } void delenode(linklist head, char ID[]) { linklist p; p = head; while(p->next&&(strcmp(p->next->Staff.ID, ID)!=0)) { p = p->next; } if(p->next) { p->next = p->next->next; } else { printf("=====NO FOUND========\n"); } } void insertnode(linklist head, staff Staff) { linklist p; p = (node *)malloc(sizeof(node)); p->Staff = Staff; p->next = head->next; head->next = p; } void distroylinklist(linklist head) { linklist p; p = head; while(p!=NULL) { p = p->next; free(p); } }
3.文件存盤
file.h
#ifndef FILE_H_INCLUDED #define FILE_H_INCLUDED #include "linklist.h" #include "staff.h" //職工信息存盤 void saveinformation(linklist head ); //職工信息加載 void loadinformation(linklist head ); #endif // FILE_H_INCLUDED file.cpp #include <stdio.h> #include <string.h> #include <stdlib.h> #include "file.h" #include "linklist.h" #include "staff.h" void saveinformation(linklist h ) { FILE *fp; linklist p; if ( (fp = fopen("stu.txt","w") ) == NULL) { printf("Failure to open stu.txt!\n"); exit(0); } for ( p = h->next; p; p=p->next ) { fwrite( &(p->Staff), sizeof(node), 1, fp); } fclose(fp); } void loadinformation( linklist h ) { FILE *fp; staff nodeBuffer; if ((fp = fopen("stu.txt","r")) == NULL) { printf("\n\t數(shù)據(jù)文件丟失或為首次運行, 將加載測試數(shù)據(jù)\n"); return ; } while( fread(&nodeBuffer, sizeof(node), 1, fp)!=0 ) { insertnode(h, nodeBuffer); } }
4.主函數(shù)
mainmeun.cpp
#include <stdio.h> #include <stdlib.h> #include "linklist.h" #include "staff.h" #include "file.h" void mainmeun(linklist head); void searchmenu(linklist head); int main(void) { linklist head=NULL; //int n; //printf("------請輸入你要存的數(shù)據(jù)----------\n"); //scanf("%d", &n); head = Createlinklist(); system("cls"); //Displaylinklist(head); mainmeun(head); printf("\n\n"); //loadinformation(head); //saveinformation(head); return 0; } void mainmeun(linklist head) { linklist p; char ID[10]; //char name[10]; staff Staff; int selection; int flag = 1; do { printf("=================職工管理系統(tǒng)===================\n"); printf("==========1.鏈表輸出=====2.數(shù)據(jù)查詢=====\n"); printf("=======3.數(shù)據(jù)刪除===4.數(shù)據(jù)修改=====5.添加數(shù)據(jù)======\n"); printf("=======6.鏈表銷毀===7.信息存盤=====8.放棄存盤=====\n"); printf("==================================================\n"); printf("======請選擇功能(1~8):"); scanf("%d", &selection); switch(selection) { case 1: Displaylinklist(head); break; case 2: searchmenu(head); break; case 3: printf("=========請輸入工號==========\n"); scanf("%s", ID); delenode(head, ID); break; case 4: printf("=========請輸入工號==========\n"); scanf("%s", ID); p = searchnode(head, ID); updatestaff(&(p->Staff)); break; case 5: printf("========添加數(shù)據(jù)========="); Staff = Createstaff(); insertnode(head, Staff); break; case 6: distroylinklist(head); break; case 7: loadinformation(head); saveinformation(head); break; case 8: flag = 0; break; } }while(flag == 1); printf("========BYE=====BYE======"); } void searchmenu(linklist head) { linklist p; int flag = 1; char ID[10]; char name[10]; do { printf("=========查找菜單===========\n"); printf("===1.ID======2.name====3.退出====\n"); printf("=================================\n"); int selection; printf("==請選擇功能(1~3):"); scanf("%d", &selection); switch(selection) { case 1: printf("=====請輸入ID=======\n"); scanf("%s", ID); p = searchnode(head, ID); Displaystaff(p->Staff); break; case 2: printf("=====請輸入name======\n"); scanf("%s", name); searchnodebyname(head, name); break; case 3: flag = 0; break; } system("pause"); system("cls"); }while(flag == 1); }
以上就是本文的全部內(nèi)容,希望對大家實現(xiàn)C++職工管理系統(tǒng)有所幫助,啟發(fā)。
推薦幾篇文章:
C++實現(xiàn)簡單的圖書管理系統(tǒng)
C++實現(xiàn)簡單的職工信息管理系統(tǒng)
C++基礎(chǔ)學(xué)生管理系統(tǒng)
欄 目:C語言
下一篇:C++利用靜態(tài)成員或類模板構(gòu)建鏈表的方法講解
本文標(biāo)題:C++實現(xiàn)簡單的職工管理系統(tǒng)實訓(xùn)代碼
本文地址:http://mengdiqiu.com.cn/a1/Cyuyan/2381.html
您可能感興趣的文章
- 04-02c語言沒有round函數(shù) round c語言
- 01-10數(shù)據(jù)結(jié)構(gòu)課程設(shè)計-用棧實現(xiàn)表達式求值的方法詳解
- 01-10使用OpenGL實現(xiàn)3D立體顯示的程序代碼
- 01-10深入理解C++中常見的關(guān)鍵字含義
- 01-10求斐波那契(Fibonacci)數(shù)列通項的七種實現(xiàn)方法
- 01-10C語言 解決不用+、-、&#215;、&#247;數(shù)字運算符做加法
- 01-10使用C++實現(xiàn)全排列算法的方法詳解
- 01-10c++中inline的用法分析
- 01-10用C++實現(xiàn)DBSCAN聚類算法
- 01-10深入全排列算法及其實現(xiàn)方法


閱讀排行
本欄相關(guān)
- 04-02c語言函數(shù)調(diào)用后清空內(nèi)存 c語言調(diào)用
- 04-02func函數(shù)+在C語言 func函數(shù)在c語言中
- 04-02c語言的正則匹配函數(shù) c語言正則表達
- 04-02c語言用函數(shù)寫分段 用c語言表示分段
- 04-02c語言中對數(shù)函數(shù)的表達式 c語言中對
- 04-02c語言編寫函數(shù)冒泡排序 c語言冒泡排
- 04-02c語言沒有round函數(shù) round c語言
- 04-02c語言分段函數(shù)怎么求 用c語言求分段
- 04-02C語言中怎么打出三角函數(shù) c語言中怎
- 04-02c語言調(diào)用函數(shù)求fibo C語言調(diào)用函數(shù)求
隨機閱讀
- 01-10delphi制作wav文件的方法
- 08-05織夢dedecms什么時候用欄目交叉功能?
- 08-05dedecms(織夢)副欄目數(shù)量限制代碼修改
- 04-02jquery與jsp,用jquery
- 01-10使用C語言求解撲克牌的順子及n個骰子
- 01-10C#中split用法實例總結(jié)
- 01-11Mac OSX 打開原生自帶讀寫NTFS功能(圖文
- 01-10SublimeText編譯C開發(fā)環(huán)境設(shè)置
- 01-11ajax實現(xiàn)頁面的局部加載
- 08-05DEDE織夢data目錄下的sessions文件夾有什