首页 > 代码库 > leetcode - Swap Nodes in Pairs
leetcode - Swap Nodes in Pairs
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; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ struct ListNode { int val; ListNode *next; ListNode(int x) :val(x), next(NULL) {} }; class Solution { public: ListNode *swapPairs(ListNode *head) { if(head == NULL || head->next == NULL) { return head; } else { ListNode *p = head->next; ListNode *q = head->next->next; p->next = head; head->next = swapPairs(q); return p; } } };
leetcode - Swap Nodes in Pairs
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。