发文检测过不了，贴个代码，可忽略。lian接在代码里。
//我通过百度网盘分享的文件：王道//链接:/s/1nD9bg-JHsHwwEcMOJtOgfA?pwd=699z //提取码:699z//复制这段内容打开「百度网盘APP 即可获取」#include <iostream>struct List{int *data;int maxLength;int Length;};void InitList(List &list){list.Length = 0;list.maxLength = 10;list.data = (int *)malloc(list.maxLength * sizeof(int));}void IncreaseList(List &list, int len){int *p = list.data;list.data = (int *)malloc((list.maxLength + len) * sizeof(int));list.maxLength += len;for (int i = 0; i < list.Length; i++){list.data[i] = p[i];}free(p);}bool push_back(List &list, int v){if (list.Length >= list.maxLength){IncreaseList(list, 10);}list.data[list.Length] = v;list.Length += 1;return true;}void print_all(List &list){for (int i = 0; i < list.Length; i++){std::cout << list.data[i] << std::endl;}}bool insert(List &list, int i, int v){if (i < 1 || i > list.Length + 1){return false;}if (list.Length >= list.maxLength){IncreaseList(list, 10);}for (int j = list.Length; j >= i; j--){list.data[j] = list.data[j - 1];}list.data[i - 1] = v;list.Length += 1;return true;}bool remove(List &list, int i, int &v){if (i < 1 || i > list.Length){return false;}v = list.data[i - 1];for (int j = i; j < list.Length; j++){list.data[j - 1] = list.data[j];}list.Length -= 1;return true;}int find_position(List &list, int position){if (position < 1 || position > list.Length)return -1;return list.data[position - 1];}int find_value(List &list, int val){for (int i = 0; i < list.Length; i++){if (list.data[i] == val)return i + 1;}return 0;}int main(int argc, char const *argv[]){List list;int e = -1;InitList(list);for (int i = 0; i < 10; i++){push_back(list, i + 1);}std::cout << find_position(list, 2) << std::endl;std::cout << find_value(list, 9) << std::endl;print_all(list);return 0;}
考研王道计算机408pdf（王道计算机组成原理+王道操作系统+王道计算机网络+王道数据结构）无水印
