LeetCode 234 回文链表

回文链表

自己的代码超出时间

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool isPalindrome(ListNode* head) {
	//简单题型怎么说呢，使用快慢指针的方法进行相应的设计。
	ListNode* fast = head;
	ListNode* slow_head = head;
	ListNode* slow = head;
	int len = 0;
	while (fast != NULL)
	{
		fast = fast->next;
		++len;
	}
	if (len == 0 || len == 1)
		return true;
	fast = head;
	for (int i = 1; i <= len / 2; ++i)
	{
		slow = head;
		fast = head;
		int k = i;
		while (fast != NULL&&k - 1>0)
		{
			fast = fast->next;
			--k;
		}
		while (slow->next!= NULL&&fast->next != NULL)
		{
			slow = slow->next;
			fast = fast->next;
		}
		if (slow_head->val != slow->val)
			return false;
		//如果相等的话继续
		slow_head = slow_head->next;
	}
	return true;
}
};

参考别人的代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverse1(ListNode* head)
{
	ListNode* new_head = NULL;
	ListNode* node = head;
	ListNode* nextnode = NULL;
	while (node != NULL)
	{
		nextnode = node->next;
		node->next = new_head;
		new_head = node;
		node = nextnode;
	}
	return new_head;
}
bool isPalindrome(ListNode* head) {
	//使用翻转链表和比较的方法
	
	if (head == NULL || head->next == NULL)
		return true;
	ListNode* fast = head;
	ListNode* slow = head;
	while (fast != NULL&&fast->next != NULL)
	{
		fast = fast->next->next;
		slow = slow->next;
	}
	//开始翻转链表
	ListNode* head1 = reverse1(slow);
	ListNode* head2 = head;
	while (head1 != NULL)
	{
		if (head1->val != head2->val)
			return false;
		head1 = head1->next;
		head2 = head2->next;
	}
	return true;
}        
};