c语言链表存储结构体,学了结构体，挺有趣的，写了一个存储系统的单向链表...

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

waddstr(menu[5], "储存记录");

waddstr(menu[6], "读取记录");

waddstr(menu[7], "退出系统");

for (fi = 0; fi < 8; ++fi)

wrefresh(menu[fi]);

return menu;

}

/*

*删除窗体菜单

*/

void del_menu(WINDOW **menu)

{

int ik = 0;

while (ik++ < 8)

delwin(menu[7]);

free(menu);

}

/*

*控制函数

*/

void kongzhi(WINDOW **menu)

{

TYMEYH *head = NULL;

TYMEYH *hdtmp;

WINDOW *put_win;

int ch, dq;

put_win = newwin(LINES - 11, COLS / 8 * 3 + 32, 10, COLS / 8);

wbkgd(put_win, COLOR_PAIR(3));

scrollok(put_win, TRUE);

dq = 0;

while (1) {

ch = getch();

switch (ch) {

case KEY_UP :

case KEY_DOWN :

YS_1(menu[dq]);

wrefresh(menu[dq]);

dq = dq > 3 ? dq - 4 : dq + 4;

YS_2(menu[dq]);

wrefresh(menu[dq]);

continue;

case KEY_LEFT :

if (dq > 0)

--dq;

YS_1(menu[dq + 1]);

YS_2(menu[dq]);

wrefresh(menu[dq + 1]);

wrefresh(menu[dq]);

continue;

case KEY_RIGHT :

if (dq < 7)

++dq;

YS_1(menu[dq - 1]);

YS_2(menu[dq]);

wrefresh(menu[dq - 1]);

wrefresh(menu[dq]);

continue;

case 4 :

cxxt_exit(head);

delwin(put_win);

return;

case ENT :

switch (dq) {

case 0 :

tianjia(&head, put_win);

update(head);

continue;

case 1 :

delhs(&head, put_win);

update(head);

continue;

case 2 :

xiugai(head, put_win);

update(head);

continue;

case 3 :

chazao(head, put_win);

continue;

case 4 :

daying(head, put_win);

continue;

case 5 :

savedate(head, put_win);

continue;

case 6 :

hdtmp = readdate(put_win);

if (hdtmp != NULL) {

head = hdtmp;

update(head);

}

continue;

case 7 :

cxxt_exit(head);

delwin(put_win);

return;

}

continue;

}

}

}

int main()

{

WINDOW **z_menu;

stat_win();

if ((z_menu = zct()) == NULL) {

endwin();

return 0;

}