24. 两两交换链表中的节点
第一想法:要进行实际节点的链表交换。以两个节点为一步,然后需要知道三个节点的位置,按照③②①的逻辑去交换链表。如何删除虚拟头节点忘了....
看完想法:
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode* dummyhead = new ListNode(0);
dummyhead->next = head; //定义虚拟头节点
ListNode* cur = dummyhead;
while(cur->next->next->next != NULL)
{ //while判断条件错误,应该是判断cur下面两个节点是否是空节点,然后按123的顺序
ListNode* tmp = cur->next->next;
cur->next = cur->next->next->next;
tmp->next = cur->next; //对tmp操作是错误的,应只对cur操作赋值
cur->next = tmp; //cur要依次旺next走
cur = cur->next->next;
//cur->next = cur->next->next;
//cur->next->next = tmp;
//cur->next->next->next = tmp1; /
//cur = cur->next->next;
}
return head;//应该返回dummyhead_>next,因为head有可能已经修改过!
}
};
最后应该返回dummyhead_>next,因为head有可能已经修改过!
19.删除链表的倒数第N个节点
第一想法:仍然用到虚拟头节点,删除前需要先判断N有没有超出范围,哦题目说不会超,那没事了。得知道删除节点的前一个和后一个
看完想法:双指针的经典应用,如果要删除倒数第n个节点,让fast移动n步,然后让fast和slow同时移动,直到fast指向链表末尾。删掉slow所指向的节点就可以了。
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummyhead = new ListNode(0);
dummyhead->next = head;
ListNode* fastpoint = dummyhead;
ListNode* slowpoint = dummyhead;
while(n--){
fastpoint = fastpoint->next;
}
fastpoint = fastpoint->next;
while(fastpoint->next != nullptr)
{ //这里的终止条件应该是fastpoint != nullptr, 因为如果要删除的是倒数第1个,n+1 = 2,要fastpointer = NULL时候,slowpointer才等于删除的前一个节点
fastpoint = fastpoint->next;
slowpoint = slowpoint->next;
}
ListNode* tmp = slowpoint->next;
slowpoint->next = slowpoint->next->next;
delete tmp;
ListNode* result =dummyhead->next;
delete dummyhead;
return result;
}
};
面试题 02.07. 链表相交
第一想法:没有啥想法,不会.....
看完想法:交点不是数值相等,而是指针相等0
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
ListNode* curA = headA;
ListNode* curB = headB;
int lenA = 0, lenB = 0;
while (curA != NULL) { // 求链表A的长度
lenA++;
curA = curA->next;
}
while (curB != NULL) { // 求链表B的长度
lenB++;
curB = curB->next;
}
curA = headA;
curB = headB;
// 让curA为最长链表的头,lenA为其长度
if (lenB > lenA) {
swap (lenA, lenB);
swap (curA, curB);
}
// 求长度差
int gap = lenA - lenB;
// 让curA和curB在同一起点上(末尾位置对齐)
while (gap--) {
curA = curA->next;
}
// 遍历curA 和 curB,遇到相同则直接返回
while (curA != NULL) {
if (curA == curB) {
return curA;
}
curA = curA->next;
curB = curB->next;
}
return NULL;
}
};
142.环形链表II
第一想法:使用快慢指针法,但具体怎么做也忘了.....
看后想法:
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;
// 快慢指针相遇,此时从head 和 相遇点,同时查找直至相遇
if (slow == fast) {
ListNode* index1 = fast;
ListNode* index2 = head;
while (index1 != index2) {
index1 = index1->next;
index2 = index2->next;
}
return index2; // 返回环的入口
}
}
return NULL;
}
};