24. Swap Nodes in Pairs（python）

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.
题意：临近两结点交换位置
runtime:52ms
总结：第一次提交的时候出现Time Limit Exceed，但我觉得主要是仅仅使用两个指针交换操作超出constant space；
改进时加入一个临时指针t,并且保证链表长度不超过原长

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution(object):
    def swapPairs(self, head):
        if not head or not head.next:
            return head
        dummy=ListNode(0)
        dummy.next=head
        p=dummy
        c=p.next
        while  p.next and p.next.next:
            t=p.next.next
            c.next=t.next
            t.next=c
            p.next=t
            p=t.next
            c=p.next
        return dummy.next