同时拥有数组和链表的缺点。容量固定不变。不能随机存取。优点:增、删操作不需要大量移动元素。#include<iostream>using namespace std;#define Maxsize 10typedef struct {int data;int next;}SLinkList;bool InitSLinkList(SLinkList s[]) {s[0].next = NULL;for (int i = 1; i < Maxsize-1; i++) {s[i].next = i + 1;}s[Maxsize - 1].next = -2;return true;}bool InsertSLinkList(SLinkList *s,int e) {if (s[1].next == -2) return false;int p;p = s[1].next;s[p].data = e;s[1].next = s[p].next;if (s[0].next == NULL)s[0].next = p;s[p].next = NULL;return true;}int main() {SLinkList s[Maxsize];InitSLinkList(s);printf(&quot;%d\n&quot;, s[2].next);InsertSLinkList(s, 3);InsertSLinkList(s, 7);printf(&quot;%d %d&quot;, s[3].data,s[0].next);return 0;}