void print(void) //遍历链表输出 int length(void) //求链表长度 void insert_head(double value) //链头插入 void insert_tail(double value) //链尾插入 void insert_k(int k, double value) //第k个元素后插入 void delete_head(void) //链头结点删除 void delete_tail(void) //链尾结点删除 void delete_k(int k) //删除第k个结点 void inverse(void) //链表逆置 void destroy(void) //链表销毁 void add(mylist &list) //两个链表合并 mylist& operator=(mylist &list) //赋值运算符重载

同质链表\homework1.dsp
........\homework1.dsw
........\homework1.ncb
........\homework1.opt
........\homework1.plg
........\my_list.cpp
........\my_list.h
........\test.cpp
同质链表

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．