题目:判断链表是否为回文
输入:1->2->2->1 输出:True 输入:1->2 输出: false
法1:存入数组,再用双指针
/**
* 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) {
vector<int> s;
while (head != NULL)
{
s.push_back(head->val);
head = head->next;
}
int i = 0;
int j = s.size() - 1;
while (i < j)
{
if (s[i] != s[j]) { return false; }
else { i++; j--; }
}
return true;
}
};
法2:差速指针,后半段翻转,最后比较两链表元素
class Solution {
public:
bool isPalindrome(ListNode* head) {
if(head==NULL||head->next==NULL) return true;
ListNode *slow=head;
ListNode *fast=head;
ListNode *p1=NULL;
while(fast!=NULL&&fast->next!=NULL)
{
slow=slow->next;
fast=fast->next->next;
}
while(slow!=NULL)
{
ListNode *temp=slow->next;
slow->next=p1;
p1=slow;
slow=temp;
}
while(p1!=NULL&&head!=NULL) //奇数中点数字没进行比较
{
if(p1->val!=head->val) return false;
else {p1=p1->next;head=head->next;}
}
return true;
}
};