随笔分类 - BJFU
摘要：#include #include #define MAX 100 typedef struct Book{ double no; char name[MAX]; double price; struct Book * next; }Book,*BList; //创建列表 void CreatList(BList &B) { //头插法创建单链表 ...
阅读全文
摘要：这道题可以用头插法创建列表，然后正常输出：
阅读全文
摘要：如果编译不通过，可以将C该为C++
阅读全文
摘要：1 #include 2 #include 3 typedef struct Lnode{ 4 int num; 5 struct Lnode * next; 6 }Lnode,*LinkList; 7 8 typedef struct Link{ 9 LinkList data; 10 struct Link * next...
阅读全文
摘要：#include #include #define MAX 1000 typedef struct{ double no; char name[MAX]; double price; }Book; void createList(Book b[],int len); void traverse(Book b[],int len); int main() { Bo...
阅读全文
摘要：#include #include #define MAX 1000 typedef struct{ double no; char name[MAX]; double price; }Book; int createList(Book b[]); void traverse(Book b[],int len); double average(Book b[],int l...
阅读全文
摘要：#include<stdio.h> #include<stdlib.h> #define MAX 1000 typedef struct{ double no; char name[MAX]; double price; }Book; void createList(Book b[],int len); double getElem(Book book[],int len); void trave
阅读全文
摘要：1 #include<stdio.h> 2 #include<stdlib.h> 3 4 #define MAX 1000 5 typedef struct{ 6 double no; 7 char name[MAX]; 8 double price; 9 10 }Book; 11 12 int createList(Book b[]); 13 void traverse(Book b[],int
阅读全文
摘要：#include<stdio.h>#include<stdlib.h>#define MAX 100 typedef struct bNode{ double no; char name[MAX]; double price; struct bNode * next;}bNode,*bLnode;
阅读全文
浙公网安备 33010602011771号