24. 两两交换链表中的节点
给你一个链表,两两交换其中相邻的节点,并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题(即,只能进行节点交换)。
输入:head = [1,2,3,4]
输出:[2,1,4,3]
技巧:定义虚拟指针dummyHead指向头结点,后续就不需要对头结点单独处理了,画线操作可以能帮助更清晰理清各结点的指向;
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var swapPairs = function(head) {
let dummyHead = new ListNode(0,head);
let cur = dummyHead;
while(cur.next !== null && cur.next.next != null){
let temp1 = cur.next;
let temp2 = cur.next.next.next;
cur.next = cur.next.next;
cur.next.next = temp1;
cur.next.next.next = temp2;
cur = cur.next.next;
}
return dummyHead.next;
};
链表相交
给你两个单链表的头节点 headA 和 headB ,请你找出并返回两个单链表相交的起始节点。如果两个链表没有交点,返回 null 。
输入:intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
输出:Intersected at ‘8’
解释:相交节点的值为 8 (注意,如果两个链表相交则不能为 0)。
从各自的表头开始算起,链表 A 为 [4,1,8,4,5],链表 B 为 [5,0,1,8,4,5]。
在 A 中,相交节点前有 2 个节点;在 B 中,相交节点前有 3 个节点。
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} headA
* @param {ListNode} headB
* @return {ListNode}
*/
var getIntersectionNode = function(headA, headB) {
let countA = GetListNodeSize(headA);
let countB = GetListNodeSize(headB);
if(countA == countB){
return GetIntersected(headA,headB);
}else{
if(countA > countB){
let head_A = GetCompareHead(countA-countB,headA);
return GetIntersected(head_A,headB);
}else{
let head_B = GetCompareHead(countB-countA,headB);
return GetIntersected(headA,head_B);
}
}
};
// 链表的长度
var GetListNodeSize = function(head){
let count = 0;
let dummyHead = new ListNode(0,head);
let cur = dummyHead;
while(cur.next){
cur = cur.next;
count++;
}
return count;
}
// 开始比较的结点
var GetCompareHead = function(index,head){
let dummyHead = new ListNode(0,head);
let cur = dummyHead;
while(index > 0){
cur = cur.next;
index--;
}
return cur.next;
}
// 循环比较
var GetIntersected = function(headA,headB){
if(headA === headB){
return headA;
}else{
let cur1 = headA.next;
let cur2 = headB.next;
while(cur1 && cur2){
if(cur1 == cur2){
return cur1;
}
cur1 = cur1.next;
cur2 = cur2.next;
}
return null;
}
}