这道题大体分这样三步(初始化之后):要交换头节点和下一个节点的值首先让虚拟头节点从指向头节点指向头结点的下一个节点,接下来让第二个节点指向头节点,最后再让原来的头节点指向第三个节点。这道题小细节很多:创建tmp是因为防止虚拟头节点改变指向位置找不到原来的头节点,创建tmp1是因为,第二个节点原本指向下一个节点现在要改为指向头节点,因此如果不保存第三个节点会丢失;第二点注意循环条件两个判断:先判断下一个节点不为空,再判断下一个节点的下一个节点不为空,因为空节点不能做交换。
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* cur = dummyHead;
while (cur->next != NULL && cur->next->next != NULL) {
ListNode* tmp = cur->next;
ListNode* tmp1 = cur->next->next->next;
cur->next = cur->next->next;
cur->next->next = tmp;
tmp->next = tmp1;
cur = cur->next->next;
}
return dummyHead->next;
}
};
唯一要注意的点是要获取被删除节点的前一个节点,就要让fast指针走n+1步
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* fast = dummyHead;
ListNode* slow = dummyHead;
while (n-- && fast != NULL) {
fast = fast->next;
}
fast = fast->next; // fast走n+1步, 因为要知道被删除节点前一个节点的位置
while (fast != NULL) {
fast = fast->next;
slow = slow->next;
}
slow->next = slow->next->next;
return dummyHead->next;
}
};
这道题的思想是先计算较长的链表A与链表B的差值,再让链表A的指针先走完这些差值,当两个指针值相等时,返回这个值;否则返回空值。
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
ListNode* curA = headA;
ListNode* curB = headB;
int lenA = 0, lenB = 0;
while (curA != NULL) {
lenA++;
curA = curA->next;
}
while (curB != NULL) {
lenB++;
curB = curB->next;
}
curA = headA; // curA返回A表头
curB = headB;
if (lenB > lenA) {
// 始终让lenA成为最长边
swap(lenA, lenB);
swap(curA, curB);
}
int gap = lenA - lenB;
while (gap--) {
curA = curA->next;
}
while (curA != NULL) {
if (curA == curB) {
return curA;
}
curA = curA->next;
curB = curB->next;
}
return NULL;
}
};
本题有两个目的,一是判断是不是环形链表(让快指针每次走两步,慢指针每次走一步,如果相遇,就是环形链表;第二点是要找到环形链表入口,先将没入环的长度设为x,将入环后到快慢指针相遇的位置设为y,最后把从相遇点到入口的距离设为z。利用等式2倍慢指针走的距离=快指针即2(x+y) = x+y+n(y+z)观察出n=1时,x = z, 所以创建index1指针在快慢指针相遇的位置,index2在头节点处,当两指针相遇时就是环形链表的入口。
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode* fast = head;
ListNode* slow = head;
while (fast != NULL && fast->next != NULL) {
fast = fast->next->next;
slow = slow->next;
if (fast == slow) {
ListNode* index1 = fast;
ListNode* index2 = head;
while (index1 != index2) {
index1 = index1->next;
index2 = index2->next;
}
return index1;
}
}
return NULL;
}
};