234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:
Could you do it in O(n) time and O(1) space?
// 思路:创建一个辅助栈,依次比较即可
// 此题还有空间更高效的算法:O(1)空间复杂度,O(n)时间复杂度
/**
* 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) {
stack<ListNode*> s;
ListNode* pCur = head;
while(pCur){
s.push(pCur);
pCur = pCur->next;
}
pCur = head;
while(!s.empty()){
ListNode* temp = s.top();
s.pop();
if(temp->val != pCur->val)
return false;
pCur = pCur->next;
}
return true;
}
};