public: List() //构造函数 int size() const //返回链表的长度 bool full() const //返回链表是否已满 bool empty() const //返回链表是否已空 void clear() //清空链表 int retrieve( int position, string &x ) const //获取链表第position位置的元素到x，成功返回0，否则返回-1 int replace( int position, const string &x ) //将链表第position位置的元素换为x，成功返回0，否则返回-1 int remove( int position, string &x ) //获取并删除链表第position位置的元素，成功返回0，否则返回-1 int insert( int position, const string &x ) //将元素x插入到链表第position位置，成功返回0，否则返回-1 protected: int new_node() //返回链表的数据载体（数组）的可用index，如果链表已满则返回-1 void delete_node( int index) //删除链表数据载体（数组）index位置的元素 int current_position( int index) const //返回链表数据载体（数组）index位置的元素是链表的哪个位置，如果当前位置没有存放数据，则返回-1 int set_position( int position) const //返回链表第position位置的数据所存放的数组index，如果不存在position位置，则返回-1

Ex1.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．