024 - Swap Nodes in Pairs

最新推荐文章于 2024-05-14 23:43:29 发布

shuimuyq

最新推荐文章于 2024-05-14 23:43:29 发布

阅读量265

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/shuimuyq/article/details/49785119

版权

leetcode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.

Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

每两个节点调换一下位置,递归实现比较简单

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* swapPairs(struct ListNode* head) 
{
	if (NULL == head || NULL == head->next) return head;
	struct ListNode *tmp = swapPairs(head->next->next);
	struct ListNode *ret = head->next;
	head->next = tmp;
	ret->next = head;
	return ret;
}