/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
bool isPalindrome(ListNode* head) {
vector<int> myvec;
ListNode* p=head;
while(p){
myvec.push_back(p->val);
p=p->next;
}
int n=myvec.size();
bool flag=true;
for(int i=0;i<n/2;i++){
if(myvec[i]!=myvec[n-i-1]){
flag=false;
break;
}
}
return flag;
}
};