Reorder List (leetcode)

Given a singly linked list L: L₀→L₁→…→L_n-1→L_n,
reorder it to: L₀→L_n→L₁→L_n-1→L₂→L_n-2→…

You must do this in-place without altering the nodes' values.

For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void reorderList(ListNode *head) {
        if (!head || !head->next) {
			return;
		}
		ListNode *head_first_list = head;
		ListNode *head_second_list = NULL;

		//split this list into two lists
		ListNode *tmp = getMiddle(head_first_list);
		head_second_list = tmp->next;
		tmp->next = NULL;
		reverseList(head_second_list);
		
		while (head_first_list && head_second_list) {
			tmp = head_second_list->next;
			head_second_list->next = head_first_list->next;
			head_first_list->next = head_second_list;
			head_first_list = head_second_list->next;
			head_second_list = tmp;
		}
    }
    
    void reverseList(ListNode *&head)
	{
		if (!head || !head->next) {
			return;
		}

		ListNode *pre = head;
		ListNode *post = NULL;
		ListNode *cur = head->next;
		head->next = NULL;

		while (cur) {
			post = cur->next;
			cur->next = pre;
			pre = cur;
			cur = post;
		}
		head = pre;
	}
	
	ListNode * getMiddle(ListNode *head) 
	{
		if (!head || !head->next) {
			return head;
		}
		ListNode *slow = head;
		ListNode *fast = head;
		while ((fast->next != NULL) && (fast->next->next != NULL)) {
			fast = fast->next->next;
			slow = slow->next;
		}
		return slow;
	}
};