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.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# @param a ListNode
# @return a ListNode
def swapPairs(self, head):
if head==None or head.next==None:
return head
result = ListNode(0)
result.next = head
p = result
while p.next and p.next.next :
temp = p.next.next #Store 2nd node
p.next.next = temp.next # put 3rd node as 2nd node
temp.next = p.next # put 1st node as 3nd node
p.next = temp
p = p.next.next
return result.next