設計一個算法，通過遍歷一趟，將鏈表中所有結點的鏈接方向逆轉，仍利用原表的存儲空間。

#include <iostream>
using namespace std;typedef int Elemtype;
#define ERROR 0;
#define OK    1;typedef struct LNode
{Elemtype data;      //結點保存的數據struct LNode* next; //結構體指針
}LNode, * LinkList;/*單鏈表初始化*/
bool Init_LinkList(LinkList& L)
{L = (LinkList)malloc(sizeof(LNode));  //新建頭結點if (L == NULL){return ERROR;}L->data = 0;L->next = NULL;return OK;
}/*單鏈表頭插法*/
bool LinkList_head_instert(LinkList& L)
{int x = 0;LNode* p = NULL;while (cin >> x){p = (LinkList)malloc(sizeof(LNode));if (p != NULL)  //防止分配地址失敗{p->data = x;p->next = L->next;L->next = p;if (cin.get() == '\n') break;  //檢測換行符}else{exit(0);cout << "內存分配失敗" << endl;}}return OK;
}/*單鏈表尾插法*/
bool LinkList_tail_instert(LinkList& L)
{int x = 0;LNode* p = NULL;LNode* r = NULL;r = L;while (cin >> x){p = (LinkList)malloc(sizeof(LNode));if (p != NULL)  //防止分配地址失敗{p->data = x;p->next = NULL;r->next = p;r = p;if (cin.get() == '\n') break;  //檢測換行符}else{exit(0);cout << "內存分配失敗" << endl;}}return OK;
}/*單鏈表遍歷*/
bool LinkList_All_value(LinkList L)
{if (L->next == NULL){cout << "鏈表為空" << endl;return ERROR;}LNode* s = NULL;s = L->next;while (s != NULL){cout << s->data << "   ";s = s->next;}cout << endl;free(s);return OK;
}/*單鏈表長度*/
int LinkList_length(LinkList L)
{int count = 0;LNode* s = NULL;s = L->next;while (s != NULL){count++;s = s->next;}return count;
}/*清空單鏈表*/
void Clear_LinkList(LinkList& L)
{LNode* p = L->next;LNode* q = NULL;while (p != NULL){q = p->next;free(p);p = q;}L->next = NULL;
}/*銷毀單鏈表*/
void Destory_LinkList(LinkList& L)
{LNode* p = NULL;LNode* q = NULL;p = L;while (p != NULL){q = p->next;free(p);p = q;}L = NULL;
}
//--------------------------------------核心代碼--------------------------------------//
bool reverse(LinkList& A)  //頭插法
{LNode* pa = NULL;LNode* q = NULL;pa = A->next;A->next = NULL;if (pa == NULL){cout << "單鏈表數據為空!!!" << endl;return ERROR;}while (pa != NULL){q = pa->next;pa->next = A->next;A->next = pa;pa = q;}return OK;
}//--------------------------------------核心代碼--------------------------------------//
//設計一個算法，通過遍歷一趟，將鏈表中所有結點的鏈接方向逆轉，仍利用原表的存儲空間。int	main(void)
{LinkList A = NULL;Init_LinkList(A);LinkList_tail_instert(A);//test1: 1 2 3 100 5 6 8LinkList_All_value(A);reverse(A);//逆轉單鏈表LinkList_All_value(A);return 0;
}