欧美bbbwbbbw肥妇,免费乱码人妻系列日韩,一级黄片

C語言圖書管理系統(tǒng)課程設(shè)計

 更新時間:2018年01月12日 11:37:35   作者:iamskying  
這篇文章主要為大家詳細介紹了C語言圖書管理系統(tǒng)課程設(shè)計,具有一定的參考價值,感興趣的小伙伴們可以參考一下

這是本人大一第二學(xué)期初C語言課程設(shè)計的作品,嘿嘿,本來以為已經(jīng)找不到原稿了,今天無意中竟然在QQ網(wǎng)絡(luò)硬盤中找到了當(dāng)初的teta版,發(fā)布于此,以作紀(jì)念。

C

源代碼如下:

#include<stdio.h> 
#include<stdlib.h> 
#include<string.h> 
struct book{ 
  char book_name[30]; 
  int bianhao; 
  double price; 
  char author[20]; 
  char state[20]; 
  char name[20]; 
  char sex[10]; 
  int xuehao; 
  struct book *book_next; 
}; 
struct club{ 
  char name[20]; 
  char sex[10]; 
  int xuehao; 
  char borrow[30]; 
  struct club *club_next; 
}; 
void Print_Book(struct book *head_book);/*瀏覽所有圖書信息*/ 
void Print_Club(struct club *head_club);/*瀏覽所有會員信息*/ 
struct book *Create_New_Book();/*創(chuàng)建新的圖書庫,圖書編號輸入為0時結(jié)束*/ 
struct book *Search_Book_bianhao(int bianhao,struct book *head_book); 
struct book *Search_Book_name(char *b_name,struct book *head_book); 
struct book *Search_Book_price(double price_h,double price_l,struct book *head_book); 
struct book *Insert_Book(struct book *head_book,struct book *stud_book);/*增加圖書,逐個添加*/ 
struct book *Delete_Book(struct book *head_book,int bianhao);/*刪除圖書*/ 
struct club *Create_New_Club(); 
struct club *Search_Club_xuehao(int xuehao,struct club *head_club); 
struct club *Search_Club_name(char *c_name,struct club *head_club); 
struct club *Insert_Club(struct club *head_club,struct club *stud_club); 
struct club *Delete_Club(struct club *head_club,int xuehao); 
struct book *Lent_Book(int bianhao,int xuehao,struct book *head_book,struct club *head_club); 
struct book *back(int bianhao,int xuehao,struct book *head_book,struct club *head_club); 
int main() 
{ 
  struct book *head_book,*p_book; 
  char book_name[30],name[20],author[20],sex[10]; 
  int bianhao; 
  double price,price_h,price_l; 
  int size_book=sizeof(struct book); 
  int m=1,n=1,f; 
  char *b_name,*c_name; 
  struct club *head_club,*p_club; 
  int xuehao; 
  int size_club=sizeof(struct club); 
   
  int choice; 
  printf("/n歡迎您第一次進入圖書管理系統(tǒng)!/n/n"); 
  printf("----->[向?qū)----->[新建圖書庫]/n/n"); 
  printf("注意:當(dāng)輸入圖書編號為0時,進入下一步./n/n"); 
  head_book=Create_New_Book(); 
  system("cls"); 
  printf("/n歡迎您第一次進入圖書管理系統(tǒng)!/n/n"); 
  printf("----->[向?qū)----->[新建會員庫]/n/n"); 
  printf("注意:當(dāng)輸入會員學(xué)號為0時,進入主菜單./n/n"); 
  head_club=Create_New_Club(); 
  system("cls"); 
  do{  
    printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
    printf("/n"); 
    printf("/t/t/t[1]:借書辦理/t");printf(" [6]:還書辦理/n"); 
    printf("/n"); 
    printf("/t/t/t[2]:查詢圖書/t");printf(" [7]:查詢會員/n"); 
    printf("/t/t/t[3]:添加圖書/t");printf(" [8]:添加會員/n"); 
    printf("/t/t/t[4]:刪除圖書/t");printf(" [9]:刪除會員/n"); 
    printf("/t/t/t[5]:遍歷圖書/t");printf("[10]:遍歷會員/n/n"); 
    printf("/t/t/t〓〓〓〓〓〓〓〓〓〓〓〓〓〓〓〓/n/n"); 
    printf("/t/t/t0:退出/n/n"); 
    printf("請選擇<0~10>:"); 
    scanf("%d",&choice); 
    switch(choice){ 
    case 1: 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("輸入所借圖書編號:/n"); 
      scanf("%d",&bianhao); 
      printf("輸入借書人的學(xué)號:/n"); 
      scanf("%d",&xuehao); 
      head_book=Lent_Book(bianhao,xuehao,head_book,head_club); 
      system("cls"); 
      printf("/n借閱成功!/n/n"); 
      printf("相關(guān)信息如下:/n/n"); 
      head_book=Search_Book_bianhao(bianhao,head_book); 
      break; 
    case 2: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("1.按編號查詢/n/n"); 
      printf("2.按名稱查詢/n/n"); 
      printf("3.按價格區(qū)間查詢/n/n"); 
      printf("0.返回主菜單/n/n"); 
      printf("請選擇:"); 
      scanf("%d",&f); 
      if(f==1){ 
        printf("請輸入查詢圖書編號:"); 
        scanf("%d",&bianhao); 
        printf("相關(guān)信息如下:/n/n"); 
        head_book=Search_Book_bianhao(bianhao,head_book); 
        break; 
      } 
      else if(f==2){ 
        b_name=book_name; 
        getchar(); 
        printf("請輸入查詢圖書名稱:"); 
        gets(b_name); 
        printf("相關(guān)信息如下:/n/n"); 
        head_book=Search_Book_name(b_name,head_book); 
        break; 
      } 
      else if(f==3){ 
        printf("請輸入最高價格:"); 
        scanf("%lf",&price_h); 
        printf("請輸入最低價格:"); 
        scanf("%lf",&price_l); 
        printf("相關(guān)信息如下:/n/n"); 
        head_book=Search_Book_price(price_h,price_l,head_book); 
        break; 
      } 
      else if(f==0){ 
        break; 
      } 
      break; 
    case 6: 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("輸入所還圖書編號:/n"); 
      scanf("%d",&bianhao); 
      printf("輸入還書人的學(xué)號:/n"); 
      scanf("%d",&xuehao); 
      head_book=back(bianhao,xuehao,head_book,head_club); 
      system("cls"); 
      printf("/n歸還成功!/n/n"); 
      printf("相關(guān)信息如下:/n/n"); 
      head_book=Search_Book_bianhao(bianhao,head_book); 
      break; 
    case 3: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("請輸入圖書名稱:"); 
      scanf("%s",book_name); 
      printf("請輸入圖書編號:"); 
      scanf("%d",&bianhao); 
      printf("請輸入單價:"); 
      scanf("%lf",&price); 
      printf("請輸入作者名字:"); 
      scanf("%s",author); 
      printf("/n"); 
      struct book *ptr_b; 
      for(ptr_b=head_book;ptr_b;ptr_b=ptr_b->book_next) 
      { 
      if(ptr_b->bianhao==bianhao) 
      { 
        printf("此編號圖書已存在/n"); 
        m=0; 
        break; 
      } 
      } 
      if(m){ 
      p_book=(struct book *)malloc(size_book); 
      strcpy(p_book->book_name,book_name); 
      p_book->bianhao=bianhao; 
      p_book->price=price; 
      p_book->xuehao=0; 
      strcpy(p_book->author,author); 
      strcpy(p_book->state,"存在"); 
      strcpy(p_book->sex,"待定"); 
      strcpy(p_book->name,"待定"); 
      head_book=Insert_Book(head_book,p_book); 
      printf("/n添加圖書成功!/n/n"); 
      } 
      break; 
    case 4: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("輸入刪除圖書編號:/n"); 
      scanf("%d",&bianhao); 
      head_book=Delete_Book(head_book,bianhao); 
      printf("/n刪除圖書成功!/n/n"); 
      break; 
    case 5: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      Print_Book(head_book); 
      break; 
    case 7: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("1.按學(xué)號查詢/n/n"); 
      printf("2.按姓名查詢/n/n"); 
      printf("0.返回主菜單/n/n"); 
      printf("請選擇:"); 
      scanf("%d",&f); 
      if(f==1){ 
        printf("請輸入查詢會員學(xué)號:"); 
        scanf("%d",&xuehao); 
        printf("相關(guān)信息如下:/n/n"); 
        head_club=Search_Club_xuehao(xuehao,head_club); 
        break; 
      } 
      else if(f==2){ 
        c_name=name; 
        getchar(); 
        printf("請輸入查詢會員姓名:"); 
        gets(c_name); 
        printf("相關(guān)信息如下:/n/n"); 
        head_club=Search_Club_name(c_name,head_club); 
        break; 
      } 
      else if(f==0){ 
        break; 
      } 
      break; 
      printf("請輸入查詢會員學(xué)號:/n"); 
      scanf("%d",&xuehao); 
      printf("相關(guān)信息如下:/n/n"); 
       
      break; 
    case 8: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("請輸入會員名字:"); 
      scanf("%s",name); 
      printf("請輸入會員性別:"); 
      scanf("%s",sex); 
      printf("請輸入會員學(xué)號:"); 
      scanf("%d",&xuehao); 
      printf("/n"); 
      struct club *ptr_c; 
      for(ptr_c=head_club;ptr_c;ptr_c=ptr_c->club_next) 
      { 
      if(ptr_c->xuehao==xuehao) 
      { 
        printf("此學(xué)號會員已存在/n"); 
        n=0; 
        break; 
      } 
      } 
    if(n){ 
      p_club=(struct club *)malloc(sizeof(struct club)); 
      strcpy(p_club->name,name); 
      strcpy(p_club->sex,sex); 
      p_club->xuehao=xuehao; 
      strcpy(p_club->borrow,"暫無"); 
      head_club=Insert_Club(head_club,p_club); 
      printf("/n添加會員成功!/n/n"); 
    } 
      break; 
    case 9: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("輸入要刪除會員學(xué)號:/n"); 
      scanf("%d",&xuehao); 
      head_club=Delete_Club(head_club,xuehao); 
      printf("/n刪除會員成功!/n/n"); 
      break; 
    case 10: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      Print_Club(head_club); 
      break; 
    case 0: 
      system("cls"); 
      printf("/n/t/t/t〓〓〓〓〓圖書管理系統(tǒng)〓〓〓〓〓/n/n"); 
      printf("/n謝謝您的使用!/n/n"); 
      break; 
    } 
  }while(choice!=0); 
   
  return 0; 
} 
struct book *Create_New_Book() 
{ 
  struct book *head_book,*p_book; 
  int bianhao; 
  double price; 
  char book_name[30],author[20]; 
  int size_book=sizeof(struct book); 
   
  head_book=NULL; 
  printf("請輸入圖書名稱:"); 
  scanf("%s",book_name); 
  printf("請輸入圖書編號:"); 
  scanf("%d",&bianhao); 
  printf("請輸入單價:"); 
  scanf("%lf",&price); 
  printf("請輸入作者名字:"); 
  scanf("%s",author); 
  printf("/n");   
  while(bianhao!=0){ 
    p_book=(struct book *)malloc(size_book); 
    strcpy(p_book->book_name,book_name); 
    p_book->bianhao=bianhao; 
    p_book->price=price; 
    p_book->xuehao=0; 
    strcpy(p_book->author,author); 
    strcpy(p_book->state,"存在"); 
    strcpy(p_book->sex,"待定"); 
    strcpy(p_book->name,"待定"); 
    head_book=Insert_Book(head_book,p_book);   
    printf("請輸入圖書名稱:"); 
    scanf("%s",book_name); 
    printf("請輸入圖書編號:"); 
    scanf("%d",&bianhao); 
    printf("請輸入單價:"); 
    scanf("%lf",&price); 
    printf("請輸入作者名字:"); 
    scanf("%s",author); 
    printf("/n"); 
  } 
   
  return head_book; 
} 
struct book *Search_Book_bianhao(int bianhao,struct book *head_book) 
{ 
  struct book *ptr_book; 
  int flag=0; 
  for(ptr_book=head_book;ptr_book;ptr_book=ptr_book->book_next) 
  { 
    if(ptr_book->bianhao==bianhao){ 
      printf("圖書編號:%d/n",ptr_book->bianhao); 
      printf("圖書名稱:%s/n",ptr_book->book_name); 
      printf("圖書單價:%.2lf/n",ptr_book->price); 
      printf("圖書作者:%s/n",ptr_book->author); 
      printf("存在狀態(tài):%s/n",ptr_book->state); 
      printf("借書人姓名:%s/n",ptr_book->name); 
      printf("借書人性別:%s/n",ptr_book->sex); 
      printf("學(xué)號:%d/n",ptr_book->xuehao); 
      printf("/n"); 
      flag++; 
    } 
    } 
  if(flag==0){ 
      printf("暫無此圖書信息!/n/n"); 
  } 
  return head_book; 
} 
struct book *Search_Book_name(char *b_name,struct book *head_book) 
{ 
  struct book *ptr_book; 
  int flag=0; 
  for(ptr_book=head_book;ptr_book;ptr_book=ptr_book->book_next) 
  { 
    if(strcmp(ptr_book->book_name,b_name)==0){ 
      printf("圖書編號:%d/n",ptr_book->bianhao); 
      printf("圖書名稱:%s/n",ptr_book->book_name); 
      printf("圖書單價:%.2lf/n",ptr_book->price); 
      printf("圖書作者:%s/n",ptr_book->author); 
      printf("存在狀態(tài):%s/n",ptr_book->state); 
      printf("借書人姓名:%s/n",ptr_book->name); 
      printf("借書人性別:%s/n",ptr_book->sex); 
      printf("學(xué)號:%d/n",ptr_book->xuehao); 
      printf("/n"); 
      flag++; 
    } 
    } 
  if(flag==0){ 
      printf("暫無此圖書信息!/n/n"); 
  } 
  return head_book; 
} 
struct book *Search_Book_price(double price_h,double price_l,struct book *head_book) 
{ 
  struct book *ptr_book; 
  int flag=0; 
  for(ptr_book=head_book;ptr_book;ptr_book=ptr_book->book_next) 
  { 
    if((ptr_book->price>=price_l)&&(ptr_book->price<=price_h)){ 
      printf("圖書編號:%d/n",ptr_book->bianhao); 
      printf("圖書名稱:%s/n",ptr_book->book_name); 
      printf("圖書單價:%.2lf/n",ptr_book->price); 
      printf("圖書作者:%s/n",ptr_book->author); 
      printf("存在狀態(tài):%s/n",ptr_book->state); 
      printf("借書人姓名:%s/n",ptr_book->name); 
      printf("借書人性別:%s/n",ptr_book->sex); 
      printf("學(xué)號:%d/n",ptr_book->xuehao); 
      printf("/n"); 
      flag++; 
    } 
    } 
  if(flag==0){ 
      printf("暫無此圖書信息!/n/n"); 
  } 
  return head_book; 
} 
struct book *Delete_Book(struct book *head_book,int bianhao) 
{ 
  struct book *ptr1_book,*ptr2_book; 
   
  while(head_book!=NULL && head_book->bianhao==bianhao){ 
    ptr2_book=head_book; 
    head_book=head_book->book_next; 
    free(ptr2_book); 
  } 
  if(head_book==NULL) 
    return NULL; 
   
  ptr1_book=head_book; 
  ptr2_book=head_book->book_next; 
  while(ptr2_book!=NULL){ 
    if(ptr2_book->bianhao==bianhao){ 
      ptr1_book->book_next=ptr2_book->book_next; 
      free(ptr2_book); 
    } 
    else 
      ptr1_book=ptr2_book; 
    ptr2_book=ptr1_book->book_next; 
  } 
   
  return head_book; 
} 
struct club *Create_New_Club() 
{ 
  struct club *head_club,*p_club; 
  int xuehao; 
  char name[20],sex[10]; 
  int size_club=sizeof(struct club); 
   
  head_club=NULL; 
  printf("請輸入會員名字:"); 
  scanf("%s",name); 
  printf("請輸入會員性別:"); 
  scanf("%s",sex); 
  printf("請輸入會員學(xué)號:"); 
  scanf("%d",&xuehao); 
  printf("/n"); 
   
  while(xuehao!=0){ 
    p_club=(struct club *)malloc(size_club); 
    strcpy(p_club->name,name); 
    strcpy(p_club->sex,sex); 
    p_club->xuehao=xuehao; 
    strcpy(p_club->borrow,"暫無"); 
     
    head_club=Insert_Club(head_club,p_club); 
     
    printf("請輸入會員名字:"); 
    scanf("%s",name); 
    printf("請輸入會員性別:"); 
    scanf("%s",sex); 
    printf("請輸入會員學(xué)號:"); 
    scanf("%d",&xuehao); 
    printf("/n"); 
  } 
   
  return head_club; 
} 
struct club *Search_Club_xuehao(int xuehao,struct club *head_club) 
{ 
  struct club *ptr_club; 
  int flag=0; 
  for(ptr_club=head_club;ptr_club;ptr_club=ptr_club->club_next) 
  { 
    if(ptr_club->xuehao==xuehao){ 
      printf("會員姓名:%s/n",ptr_club->name); 
      printf("會員性別:%s/n",ptr_club->sex); 
      printf("會員學(xué)號:%d/n",ptr_club->xuehao); 
      printf("所借圖書:%s/n",ptr_club->borrow); 
      printf("/n"); 
      flag++; 
    } 
    } 
  if(flag==0){ 
      printf("此用戶不存在!/n/n"); 
  } 
  return head_club; 
} 
struct club *Search_Club_name(char *c_name,struct club *head_club) 
{ 
  struct club *ptr_club; 
  int flag=0; 
  for(ptr_club=head_club;ptr_club;ptr_club=ptr_club->club_next) 
  { 
    if(strcmp(ptr_club->name,c_name)==0){ 
      printf("會員姓名:%s/n",ptr_club->name); 
      printf("會員性別:%s/n",ptr_club->sex); 
      printf("會員學(xué)號:%d/n",ptr_club->xuehao); 
      printf("所借圖書:%s/n",ptr_club->borrow); 
      printf("/n"); 
      flag++; 
    } 
    } 
  if(flag==0){ 
      printf("此用戶不存在!/n/n"); 
  } 
  return head_club; 
} 
struct book *Lent_Book(int bianhao,int xuehao,struct book *head_book,struct club *head_club) 
{ 
  struct book *ptr_book; 
  struct club *ptr_club; 
  int flag=0; 
   
  for(ptr_book=head_book;ptr_book;ptr_book=ptr_book->book_next) 
    for(ptr_club=head_club;ptr_club;ptr_club=ptr_club->club_next) 
    { 
      if((ptr_book->bianhao==bianhao)&&(ptr_club->xuehao==xuehao)) 
      { 
        strcpy(ptr_book->name,ptr_club->name);  /*字符串的復(fù)制,把右邊的內(nèi)容復(fù)制到左邊*/ 
        strcpy(ptr_book->sex,ptr_club->sex); 
        ptr_book->xuehao=ptr_club->xuehao; 
        strcpy(ptr_book->state,"暫無"); 
        strcpy(ptr_club->borrow,ptr_book->book_name); 
        flag++; 
      } 
      if(flag==0){ 
        printf("暫無此圖書或您還未注冊為會員!/n/n"); 
      } 
    } 
     
    return head_book; 
} 
struct book *back(int bianhao,int xuehao,struct book *head_book,struct club *head_club) 
{ 
  struct book *ptr_book; 
  struct club *ptr_club; 
  int flag=0; 
   
  for(ptr_book=head_book;ptr_book;ptr_book=ptr_book->book_next) 
    for(ptr_club=head_club;ptr_club;ptr_club=ptr_club->club_next) 
    { 
      if((ptr_book->bianhao==bianhao) && (ptr_club->xuehao==xuehao)) 
      { 
        strcpy(ptr_book->name,"暫無"); 
        strcpy(ptr_book->sex,"待定"); 
        ptr_book->xuehao=0; 
        strcpy(ptr_book->state,"暫無"); 
        strcpy(ptr_club->borrow,"暫無"); 
        flag++; 
      } 
      if(flag==0){ 
        printf("輸入有誤,請重試/n/n"); 
      } 
    } 
     
    return head_book; 
} 
struct book *Insert_Book(struct book *head_book,struct book *stud_book) 
{ 
  struct book *ptr_b,*ptr1_b,*ptr2_b; 
  ptr2_b=head_book; 
  ptr_b=stud_book; 
  if(head_book==NULL){ 
    head_book=ptr_b; 
    head_book->book_next=NULL; 
  } 
  else{ 
    while((ptr_b->bianhao > ptr2_b->bianhao) && (ptr2_b->book_next!=NULL)){ 
      ptr1_b=ptr2_b; 
      ptr2_b=ptr2_b->book_next; 
    } 
    if(ptr_b->bianhao <= ptr2_b->bianhao){ 
      if(head_book==ptr2_b) head_book=ptr_b; 
      else ptr1_b->book_next=ptr_b; 
      ptr_b->book_next=ptr2_b; 
    } 
    else{ 
      ptr2_b->book_next=ptr_b; 
      ptr_b->book_next=NULL; 
    } 
  } 
  return head_book; 
} 
struct club *Insert_Club(struct club *head_club,struct club *stud_club) 
{ 
  struct club *ptr_c,*ptr1_c,*ptr2_c; 
  ptr2_c=head_club; 
  ptr_c=stud_club; 
  if(head_club==NULL){ 
    head_club=ptr_c; 
    head_club->club_next=NULL; 
  } 
  else{ 
    while((ptr_c->xuehao > ptr2_c->xuehao) && (ptr2_c->club_next!=NULL)){ 
      ptr1_c=ptr2_c; 
      ptr2_c=ptr2_c->club_next; 
    } 
    if(ptr_c->xuehao <= ptr2_c->xuehao){ 
      if(head_club==ptr2_c) head_club=ptr_c; 
      else ptr1_c->club_next=ptr_c; 
      ptr_c->club_next=ptr2_c; 
    } 
    else{ 
      ptr2_c->club_next=ptr_c; 
      ptr_c->club_next=NULL; 
    } 
  } 
  return head_club; 
} 
void Print_Club(struct club *head_club) 
{ 
  struct club *ptr_c; 
  if(head_club==NULL){ 
    printf("/n無記錄/n/n"); 
    return; 
  } 
  printf("/n會員姓名/t會員性別/t會員學(xué)號/n/n"); 
  for(ptr_c=head_club;ptr_c;ptr_c=ptr_c->club_next) 
    printf("%s/t/t%s/t/t%d/n",ptr_c->name,ptr_c->sex,ptr_c->xuehao); 
} 
struct club *Delete_Club(struct club *head_club,int xuehao) 
{ 
  struct club *ptr1_club,*ptr2_club; 
   
  while(head_club!=NULL && head_club->xuehao==xuehao){ 
    ptr2_club=head_club; 
    head_club=head_club->club_next; 
    free(ptr2_club); 
  } 
  if(head_club==NULL) 
    return NULL; 
   
  ptr1_club=head_club; 
  ptr2_club=head_club->club_next; 
  while(ptr2_club!=NULL){ 
    if(ptr2_club->xuehao==xuehao){ 
      ptr1_club->club_next=ptr2_club->club_next; 
      free(ptr2_club); 
    } 
    else 
      ptr1_club=ptr2_club; 
    ptr2_club=ptr1_club->club_next; 
  } 
   
  return head_club; 
} 
void Print_Book(struct book *head_book) 
{ 
  struct book *ptr_b; 
  if(head_book==NULL){ 
    printf("/n無記錄/n/n"); 
    return; 
  } 
  printf("/n圖書編號/t圖書名稱/t圖書單價/t圖書作者/n/n"); 
  for(ptr_b=head_book;ptr_b;ptr_b=ptr_b->book_next) 
    printf("%d/t/t%s/t/t%.2lf/t/t%s/n/n",ptr_b->bianhao,ptr_b->book_name,ptr_b->price,ptr_b->author); 
}

以上就是本文的全部內(nèi)容,希望對大家的學(xué)習(xí)有所幫助,也希望大家多多支持腳本之家。

相關(guān)文章

  • C++二叉樹的前序中序后序非遞歸實現(xiàn)方法詳細講解

    C++二叉樹的前序中序后序非遞歸實現(xiàn)方法詳細講解

    前序遍歷的順序是根、左、右。任何一顆樹都可以認(rèn)為分為左路節(jié)點,左路節(jié)點的右子樹。先訪問左路節(jié)點,再來訪問左路節(jié)點的右子樹。把訪問左路節(jié)點的右子樹看成一個子問題,就可以完整遞歸訪問了
    2023-03-03
  • C語言預(yù)處理詳解

    C語言預(yù)處理詳解

    這篇文章主要給大家介紹了關(guān)于C語言之預(yù)處理的相關(guān)資料,文中通過示例代碼介紹的非常詳細,對大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價值,需要的朋友們下面隨著小編來一起學(xué)習(xí)學(xué)習(xí)吧
    2021-10-10
  • 淺談C++反向迭代器的設(shè)計

    淺談C++反向迭代器的設(shè)計

    本文主要介紹了淺談C++反向迭代器的設(shè)計,文中通過示例代碼介紹的非常詳細,對大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價值,需要的朋友們下面隨著小編來一起學(xué)習(xí)學(xué)習(xí)吧
    2023-04-04
  • C語言實現(xiàn)貪吃蛇超詳細教程

    C語言實現(xiàn)貪吃蛇超詳細教程

    本文詳細講解了C語言實現(xiàn)貪吃蛇的方法,文中通過示例代碼介紹的非常詳細。對大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價值,需要的朋友們下面隨著小編來一起學(xué)習(xí)學(xué)習(xí)吧
    2021-12-12
  • C++實現(xiàn)判斷一個字符串是否為UTF8或GBK格式的方法

    C++實現(xiàn)判斷一個字符串是否為UTF8或GBK格式的方法

    這篇文章主要介紹了C++實現(xiàn)判斷一個字符串是否為UTF8或GBK格式的方法,涉及C++針對字符編碼的遍歷、判斷、編碼轉(zhuǎn)換等相關(guān)操作技巧,需要的朋友可以參考下
    2017-11-11
  • C++實現(xiàn)電子時鐘效果

    C++實現(xiàn)電子時鐘效果

    這篇文章主要為大家詳細介紹了C++實現(xiàn)電子時鐘效果,文中示例代碼介紹的非常詳細,具有一定的參考價值,感興趣的小伙伴們可以參考一下
    2022-05-05
  • C/C++實現(xiàn)三路快速排序算法原理

    C/C++實現(xiàn)三路快速排序算法原理

    這篇文章主要為大家詳細介紹了C/C++實現(xiàn)三路快速排序算法原理,具有一定的參考價值,感興趣的小伙伴們可以參考一下
    2019-05-05
  • windows下用c++獲取本機ip地址的三種方法

    windows下用c++獲取本機ip地址的三種方法

    工作過程中遇到一個需求,需要獲取本機ip地址,同時獲取本機網(wǎng)絡(luò)連接情況,即網(wǎng)線是否連接,經(jīng)過多番搜索,本文給大家介紹了3種方案,通過代碼示例介紹的非常詳細,需要的朋友可以參考下
    2023-11-11
  • c++智能指針的超詳細講解

    c++智能指針的超詳細講解

    c++程序設(shè)計中經(jīng)常會用堆內(nèi)存,程序員要自己管理內(nèi)存的申請和釋放,使用原始指針,容易造成堆內(nèi)存泄漏(忘記釋放),二次釋放,使用智能指針能更好的管理堆內(nèi)存,下面這篇文章主要給大家介紹了關(guān)于c++智能指針的相關(guān)資料,需要的朋友可以參考下
    2022-06-06
  • C++結(jié)構(gòu)體案例練習(xí)分享

    C++結(jié)構(gòu)體案例練習(xí)分享

    這篇文章主要和大家分享幾個C++?結(jié)構(gòu)體的案例練習(xí),幫助大家更好的理解和學(xué)習(xí)c++,感興趣的朋友可以了解下,希望能夠給你帶來幫助
    2022-04-04

最新評論