day04链表part02

24. 两两交换链表中的节点

给你一个链表，两两交换其中相邻的节点，并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题（即，只能进行节点交换）。

链接

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
 class Solution {
    public ListNode swapPairs(ListNode head) {
        ListNode dummyNode= new ListNode(-1);
        dummyNode.next = head;
        ListNode cur =dummyNode;
        ListNode temp;
        ListNode firstNode;
        ListNode secondNode;
        while(cur.next != null && cur.next.next != null){
            temp = cur.next.next.next;
            firstNode = cur.next;
            secondNode = cur.next.next;
            cur.next = secondNode;
            secondNode.next =firstNode;
            firstNode.next =temp;
            cur =firstNode;
        }
        return dummyNode.next;
    }
}

总结
1、注意ACM模式下要自己写链表的定于
2、考虑虚拟节点的设置
3、注意while循环内部的迭代的值是否可以每次都更新

19.删除链表的倒数第N个节点

链接

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode dummyNode = new ListNode(0);
        dummyNode.next = head;
        ListNode fastNode = dummyNode;
        ListNode slowNode = dummyNode;
       for(int i =0;i<=n;i++){
            fastNode =fastNode.next;
        }
        while(fastNode!=null){
            fastNode =fastNode.next;
            slowNode =slowNode.next;
        }
        slowNode.next = slowNode.next.next;
        return dummyNode.next;
    }

    
}

双指针法，注意fast指针到底要要移到哪一个位置上

面试题 02.07. 链表相交

链接

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        int lenA=0;
        int lenB=0;
        ListNode curA = headA;
        ListNode curB = headB;
        while (curA != null) { // 求链表A的长度
            lenA++;
            curA = curA.next;
        }
        while (curB != null) { // 求链表B的长度
            lenB++;
            curB = curB.next;
        }
        curA = headA;
        curB = headB;
        if (lenB > lenA) {
            //1. swap (lenA, lenB);
            int tmpLen = lenA;
            lenA = lenB;
            lenB = tmpLen;
            //2. swap (curA, curB);
            ListNode tmpNode = curA;
            curA = curB;
            curB = tmpNode;
        }


        int dec=lenA-lenB;
        for(int i=0;i<dec;i++){
            curA = curA.next;
        }
         while (curA != null) {
            if (curA == curB) {
                return curA;
            }
            curA = curA.next;
            curB = curB.next;
        }
        return null;
    }
}

一般情况下复制链表进行移位操作，这样的话在操作完可以对该链表重新赋值