Leetcode206.Reverse_Linked_List

思路见Leetcode92.Reverse_Linked_List_II
时间复杂度:O(N)
C++代码：

class Solution {
public:
	ListNode * reverseList(ListNode* head) {
		if (head == nullptr || head->next == nullptr)
			return head;
		if (head->next->next == nullptr)
		{
			ListNode* temp = head->next;
			temp->next = head;
			head->next = nullptr;
			return temp;
		}
		ListNode* p1 = head, *p2, *p3;
		p2 = p1->next;
		p3 = p2->next;
		while (1)
		{
			p2->next = p1;
			p1 = p2;
			p2 = p3;
			if (p3 == nullptr)
				break;
			p3 = p3->next;
		}
		head->next = nullptr;
		return p1;
	}
};