24. 两两交换链表中的节点
思路与重点
- 使用了一个虚拟头节点,指向题目给出的头节点,然后进行模拟即可,一定要画图把指针变换的步骤弄清楚,再写代码会容易很多。最后不要忘记将虚拟头结点释放掉。
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* cur = dummyHead;
while(cur->next != nullptr && cur->next->next != nullptr) {
ListNode* tmp = cur->next;
ListNode* tmp1 = cur->next->next->next;
cur->next = cur->next->next;
cur->next->next = tmp;
cur->next->next->next = tmp1;
cur = cur->next->next;
}
ListNode* result = dummyHead->next;
delete dummyHead;
return result;
}
};
19.删除链表的倒数第N个节点
思路与重点
- 使用虚拟头结点和双指针法。
- 使用slow和fast两个指针,要删除倒数第n个,那么可以fast指针先走n步,然后slow和fast同步前进直到fast到达链表末尾,这样就用一次扫描找到了倒数第n个节点,然后就是普通的删除步骤。
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummyHead = new ListNode(0, head);
ListNode* slow = dummyHead;
ListNode* fast = dummyHead;
for(int i = 0; i < n; i++){
fast = fast->next;
}
while(fast->next){
fast = fast->next;
slow = slow->next;
}
ListNode* temp = slow->next->next;
delete slow->next;
slow->next = temp;
head = dummyHead->next;
delete dummyHead;
return head;
}
};
面试题 02.07. 链表相交
思路与重点
- 要找相交的节点,其实也就是指针的值相等,可以先分别求出两个链表各自的长度,得到长度之差,让长一些的链表先走几步,然后两个链表的指针同时前进,如果指针的值相等则说明有相交。
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
ListNode* curA = headA;
ListNode* curB = headB;
int lenA = 0;
int lenB = 0;
while(curA){
curA = curA->next;
lenA++;
}
while(curB){
curB = curB->next;
lenB++;
}
curA = headA;
curB = headB;
if(lenA < lenB){
swap(lenA, lenB);
swap(curA, curB);
}
int diff = lenA - lenB;
while(diff--){
curA = curA->next;
}
while(curA){
if(curA == curB) return curA;
curA = curA->next;
curB = curB->next;
}
return nullptr;
}
};
142.环形链表II
思路与重点
- 最直观的用哈希表存储走过的节点指针。时间复杂度: O(n),空间复杂度: O(n)。
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
unordered_set<ListNode *> visited;
while(head){
if(visited.count(head)){
return head;
}
visited.insert(head);
head = head->next;
}
return nullptr;
}
};
- 想要在O(1)空间的条件下完成,先判断链表是否有环,然后如果有环,再找环的入口,需要用到一些数学推理的知识,详见代码随想录的推理,非常非常详细。
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode* fast = head;
ListNode* slow = head;
while(fast != NULL && fast->next != NULL) {
slow = slow->next;
fast = fast->next->next;
if (slow == fast) {
ListNode* index1 = fast;
ListNode* index2 = head;
while (index1 != index2) {
index1 = index1->next;
index2 = index2->next;
}
return index2;
}
}
return NULL;
}
};
- 时间复杂度: O(n),快慢指针相遇前,指针走的次数小于链表长度,快慢指针相遇后,两个index指针走的次数也小于链表长度,总体为走的次数小于 2n。
- 空间复杂度: O(1)