-
Notifications
You must be signed in to change notification settings - Fork 62
/
palindrome_linked_list.cpp
64 lines (56 loc) · 1.42 KB
/
palindrome_linked_list.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
// 回文链表
#include "vector"
using namespace std;
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 isPalindrome1(ListNode* head) {
vector<int> arr;
while (head) {
arr.push_back(head->val);
head = head->next;
}
for (int i = 0, j = arr.size() - 1; i < j; i++, j--) {
if (arr[i] != arr[j]) {
return false;
}
}
return true;
}
// 找到中间节点再反转再比较
bool isPalindrome2(ListNode* head) {
// 找到中间节点
ListNode* slow = head, *fast = head;
while (fast && fast->next) {
slow = slow->next;
fast = fast->next->next;
}
// 反转
ListNode* prev = nullptr, *p = head;
while (p != slow) {
ListNode* next = p->next;
p->next = prev;
prev = p;
p = next;
}
ListNode* q = slow;
if (fast != nullptr) {
q = slow->next;
}
while (prev && q) {
if (prev->val != q->val) {
return false;
}
prev = prev->next;
q = q->next;
}
return true;
}
};