bool LinkInsert(LinkList*& L, int i, int& e { //在带头节点的单链表L中第i个位置插入值为e的新节点 int j...
//尾插法 bool ListInsert_back(LinkList*& L, LinkNode* node { LinkNode* last = NULL;...
定义链表的数据结构typedef struct _LinkNode { int data; //节点的数据 struct _LinkNode* next; //节点的指...
void destroyList(SqList& L { if (L.elems delete[] L.elems; L.length = 0; L.size&...
bool listDelete(SqList& L, int i { if (i < 0 || i >= L.leng...
bool listInsert(SqList& L, int i, int e { if (i < 0 || i ...
#include <iostream> using namespace std; #define MAX_SIZE 100 /* typedef struct ...
...
### 4.3 跳转语句...