第一次数据结构课程实验链表-栈-队列.docxVIP

顺序表就地逆置：、思路：将顺序表表首表尾的元素，通过一个中介的变量，进行一一置换，实现逆置。//顺序表的就地逆置//#define MaxSize 10//可修改顺序表大小#includestdio.htypedef struct{int list[MaxSize];}SeqList;void ListInput(SeqList*L)//输入函数{int i = 0;for (; i MaxSize; i++){scanf_s(%d, L-list[i]);}}void ListOutput(SeqList *L)//输出函数{int i = 0;for (; i MaxSize; i++){printf(%d , L-list[i]);}}void Change(SeqList*L, int a, int b){int c;c = L-list[a];L-list[a] = L-list[b];L-list[b] = c;}void reverse(SeqList*L)//逆置算法{int i = 0;for (; i (int)(MaxSize / 2); i++)Change(L, i, MaxSize - i - 1);}int main()//主函数{int i = 0;SeqList L;ListInput(L);reverse(L);//逆置printf(逆置后：\n);ListOutput(L);getchar();getchar();//防闪退return 1;}单链表就地逆置思路：为了不产生新的空间，减小空间复杂度，我决定先将头部结点与链表分离，然后将其与部分按结点先后顺序依次使用头插法。代码：#includestdio.h#includestdlib.htypedef struct Node{int data;struct Node *next;}SLNode;void InitList(SLNode * * head){if ((*head = (SLNode *)malloc(sizeof(SLNode))) == NULL)exit(1);(*head)-next = NULL;}int ListInsert(SLNode *head, int i, int x){ SLNode *p, *s; int j; p = head; j = -1; while (p-next != NULLji - 1) { p = p-next; j++;} if (j != i - 1) {printf(\n插入位置不合理!); return 0; } if ((s = (SLNode *)malloc(sizeof(SLNode))) == NULL)exit(1); s-data = x; s-next = p-next; p-next = s; return 1; }int ListLength(SLNode * head){SLNode * p = head;int size = 0;while (p-next != NULL){p = p-next;size++;}return size;}int ListGet(SLNode *head, int i) {SLNode *p; int j;p = head;j = -1;while (p-next != NULLji){p = p-next; j++;}if (j != i){printf(取元素位置参数错！);return NULL;}return p-data;}int change(SLNode *head)//算法核心。将头部与其他部分分开后使用头插法{ if (head-next == NULL){printf(链表为空，无法逆置\n);return 0;}SLNode *q, *p,*t;q = head-next-next;t = head-next;for (; q-next != NULL; ){p = q;q = q-next;p-next = head-next;head-next = p;}q-next = head-next;head-next = q;t-next = NULL;}int main(){SLNode *head;int i, x;InitList(head);for (i = 0; i 10; i++){ int m;scanf_s(%d, m);ListInsert(head, i, m);}printf(逆置前：\n);for (i = 0; i ListLength(head); i++){printf(%d , ListGet(head, i));}p