Swap Nodes in Pairs
2014-02-18 07:07
211 查看
Question:
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
Solution:/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode swapPairs(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode tmp = head.next.next;
head.next.next = head;
head = head.next;
head.next.next = swapPairs(tmp);
return head;
}
}
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.
Solution:/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode swapPairs(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode tmp = head.next.next;
head.next.next = head;
head = head.next;
head.next.next = swapPairs(tmp);
return head;
}
}
相关文章推荐
- leetcode swap nodes in pairs
- Swap Nodes in Pairs
- [Leetcode]Swap Nodes in Pairs
- LeetCode24 Swap Nodes in Pairs 25. Reverse Nodes in k-Group详解
- Swap Nodes in Pairs -- LeetCode
- LeetCode | Swap Nodes in Pairs(将链表中的元素两两交换)
- leetcode 24. Swap Nodes in Pairs
- Algorithms—24.Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- leetcode 24.Swap Nodes in Pairs
- Leetcode-Swap Nodes in Pairs
- Swap Nodes in Pairs
- 个人记录-LeetCode 24. Swap Nodes in Pairs
- 链表 Swap Nodes in Pairs
- LeetCode 24. Swap Nodes in Pairs
- 24. Swap Nodes in Pairs
- leetcode-24. Swap Nodes in Pairs
- 24. Swap Nodes in Pairs。