思路:用栈和队列遍历一遍,然后再比较
class Solution {
public:
bool isPalindrome(ListNode* head) {
queue<int> que;
stack<int> sta;
ListNode * p = head;
while(p) {
que.push(p->val);
sta.push(p->val);
p = p->next;
}
bool ret = true;
while(sta.size()){
if(sta.top() != que.front()){
ret = false;
break;
}
sta.pop();
que.pop();
}
return ret;
}
};