234.回文链表

请判断一个链表是否为回文链表。

示例 1:

输入: 1->2
输出: false
示例 2:

输入: 1->2->2->1
输出: true

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

	ListNode* BuyNode(int val)
	{
		ListNode* newNode = new ListNode(val);
		newNode->next = NULL;
		return newNode;
	}

	ListNode* CopyList(ListNode* head)
	{
		if (NULL == head)
			return NULL;
		ListNode* newList = new ListNode(head->val);
		head = head->next;
		ListNode* cur = newList;

		
		while(head)
		{
			ListNode* tmp = BuyNode(head->val);
			cur->next = tmp;
			head = head->next;
			cur = cur->next;
		}
		cur->next = NULL;
		return newList;
	}

	bool isPalindrome(ListNode* head) {
		if (NULL == head || head->next == NULL)
			return true;

		ListNode* newHead = CopyList(head);

		ListNode* newList = NULL;
		ListNode* temp = NULL;
		ListNode* cur = head;
		while (cur)
		{
			temp = cur;
			cur = cur->next;
			temp->next = newList;
			newList = temp;
		}
		while (newList && newHead)
		{
			if (newList->val != newHead->val)
			{
				return false;
			}
			newList = newList->next;
			newHead = newHead->next;
		}
		return true;
	}
};