inverse_SqList(int arr[], size_t len)
算法: 前一半和后一半交换
![](/Images/OutliningIndicators/None.gif)
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](/Images/OutliningIndicators/ContractedBlock.gif)
![](https://www.cnblogs.com/Images/dot.gif)
![](/Images/OutliningIndicators/InBlock.gif)
![](/Images/OutliningIndicators/InBlock.gif)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](/Images/OutliningIndicators/ContractedSubBlock.gif)
![](https://www.cnblogs.com/Images/dot.gif)
![](/Images/OutliningIndicators/InBlock.gif)
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
![](/Images/OutliningIndicators/ExpandedBlockEnd.gif)
2.21 单链表的就地逆置
inverse_LinkList(LinkNode *head)
算法: 先将头节点和第一个节点断开, 然后从第1个节点开始将每个节点插入到头节点后(即成为第1个节点)
inverse_LinkList(LinkNode
*
head)
{
assert(head != NULL && head -> next != NULL);
LinkNode * curPtr, * NextPtr;
curPtr = head -> next;
while (curPtr != NULL)
{
nextPtr = curPtr -> next;
curPtr -> next = head -> next;
head -> next = curPtr;
curPtr = nextPtr;
}
}
{
assert(head != NULL && head -> next != NULL);
LinkNode * curPtr, * NextPtr;
curPtr = head -> next;
while (curPtr != NULL)
{
nextPtr = curPtr -> next;
curPtr -> next = head -> next;
head -> next = curPtr;
curPtr = nextPtr;
}
}