c语言实现 顺序表、链表的转置Reverse操作

大三狗比较菜，以上代码在我的机子能运行，不保证完全正确...如有错误，欢迎指正！！！

顺序表的转置操作：

void reverse(Sqlist* s) {
	int i = 0, j = s->length - 1, temp = 0;
	while (i < j) {
		temp = s->a[i];
		s->a[i] = s->a[j];
		s->a[j] = temp;
		i++; j--;
	}
}

 main函数：

int main() {
	Sqlist s;	s.length = 4;
	s.a[0] = 0; s.a[1] = 1; s.a[2] = 2; s.a[3] = 3;
	insertElem(&s, 1, 100);
	for (int i = 0; i < s.length; i++) {
		printf("a[%d]=%d\n", i, s.a[i]);
	}

	printf("Reversing...........\n");
	reverse(&s);
	for (int i = 0; i < s.length; i++) {
		printf("a[%d]=%d\n", i, s.a[i]);
	}
	return 0;
}

单链表的转置操作

#include <stdio.h>
#include <malloc.h>

typedef struct LNode {
	int data;
	struct LNode* next;
}LNode, * LinkList;

LinkList insertFromHead(LinkList L) {//头插法
	L = (LinkList)malloc(sizeof(LNode));
	L->next = NULL;
	LinkList p;	int x;
	scanf_s("%d", &x);
	while (x != -1) {
		p = (LinkList)malloc(sizeof(LNode));
		p->data = x;
		p->next = L->next;
		L->next = p;
		scanf_s("%d", &x);
	}
	return L;
}

void PrintNode(LinkList L) {
	LinkList p = L->next;
	while (p) {
		printf("%d\n", p->data);
		p = p->next;
	}
}

//在链表中找出第id个元素，返回它的位置？0开始
LinkList findByID(LinkList L, int id) {
	LinkList p = L->next; int i = 0;
	if (id<0)	return L;
	while (i < id) {
		p = p->next;
		i++;	//*****
	}
	return p;
}

//将链表的i到j个元素转置
void reverse(LinkList L, int i, int j) {
	LinkList p1 = findByID(L, i-1 );
	LinkList p2 = findByID(L, j);
	LinkList t = p1->next;
	while (p1->next != p2) {//***不能写成 t!=p2
		t = p1->next;
		p1->next = t->next;
		t->next = p2->next;
		p2->next = t;
	}
}
// 1 2 3 4 100 -1
int main() {
	LNode n;
	LinkList p;
	p = insertFromHead(&n);
	PrintNode(p);
	printf("Reversing............\n");
	reverse(p, 0, 4);
	PrintNode(p);
	return 0;
}