纯C语言链表操作思路:
1,定义三个指针,pre,preNext,temp
2,pre指向相邻节点的第一个节点,preNext指向相邻节点的第二个节点,temp指向pre,temp的作用是保持上一组相邻节点和下一组相邻节点的联系
3,操作pre和preNext,交换两个相邻节点
4,temp作为上一组相邻节点的第二节点的指针,指向交换好的下一组节点第一指针
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* swapPairs(struct ListNode* head)
{
if(head == NULL || head -> next == NULL)
return head;
struct ListNode *pre = head;
struct ListNode *preNext = pre->next;
struct ListNode *returnHead = preNext;
struct ListNode *temp = NULL;
while(preNext != NULL)
{
pre -> next = preNext -> next;
preNext -> next = pre;
if(temp != NULL)
temp->next = preNext;
temp = pre;
pre = pre->next;
if(pre == NULL)
break;
preNext = pre -> next;
}
return returnHead;
}
运行结果: