24 Swap Nodes in Pairs

class Solution {
public:
	ListNode* swapPairs(ListNode* head) {
		if (!head)return head;
		if (!head->next)return head;
		ListNode *firstNode = new ListNode(0);
		ListNode *p = firstNode;
		ListNode *it1 = head;
		ListNode *it2 = head->next;
		while (it1&&it2) {
			p->next = new ListNode(it2->val);
			p = p->next;
			p->next = new ListNode(it1->val);
			p = p->next;
			if (it1->next->next) {
				it1=it1->next->next;
				if (it2->next->next) {
					it2=it2->next->next;
				}
				else {
					p->next = new ListNode(it1->val);
					break;
				}
			}
			else {
				break;
			}
		}
		return firstNode->next;
	}
};

猜你喜欢

转载自blog.csdn.net/Leslie5205912/article/details/84302239