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.

#include<iostream>
#include<string>
using namespace::std;


//Definition for singly-linked list.
struct ListNode {
      int val;
      ListNode *next;
      ListNode(int x) : val(x), next(NULL) {}
  };

class Solution {
public:
    ListNode *swapPairs(ListNode *head) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
		ListNode *cur = NULL, *next = NULL, *tmp = NULL, *pre = NULL;
		cur = head;
		if(cur != NULL && cur->next != NULL)
			head = cur->next;
		while(cur != NULL)
		{
			if(cur->next == NULL)
			{
				return head;
			}			
			next = cur->next;
			if(pre != NULL)
				pre->next = next;
			tmp = next->next;
			next->next = cur;
			cur->next = tmp;
			pre = cur;
			cur = cur->next;

		}
		return head;
        
    }
};

Round 2:

class Solution {
public:
    ListNode *swapPairs(ListNode *head) {
        
		if(head == NULL || head->next == NULL)
			return head;
		ListNode *newHead = head->next;
		while(head->next != NULL)
		{
			ListNode *temp = head->next->next;
			head->next->next = head;
			if(temp == NULL)
			{
				head->next = NULL;
				break;
			}
			else if(temp->next == NULL)
			{
				head->next = temp;
				break;
			}
			else
				head->next = temp->next;
			head = temp;
		}
		return newHead;
    }
};