DAY04——链表part2

题目1

 1.设置虚拟头节点

2.循环：更改链表中指针的指向

class Solution {
    public ListNode swapPairs(ListNode head) {
        ListNode dummyhead = new ListNode(-1);
        dummyhead.next = head;
        ListNode cur = dummyhead;
        ListNode temp;
        ListNode temp1;
        while(cur.next != null &&cur.next.next != null){
             temp = cur.next;
             temp1 = cur.next.next.next;

             cur.next = cur.next.next;
             cur.next.next = temp;
             temp.next = temp1;

             cur = cur.next.next;
        }
        return dummyhead.next;
    }
}

题目2

 

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode dummyhead = new ListNode(-1, head);
        ListNode fast = dummyhead;
        ListNode slow = dummyhead;
        for(int i = 0; i < n; i++){
            fast = fast.next;
        }
        fast = fast.next;
        while(fast != null){
            slow = slow.next;
            fast = fast.next;
        }
        slow.next = slow.next.next;
        return dummyhead.next;
    }
}

题目3

 

public 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;

        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 gap = lenA - lenB;
        while (gap-- > 0) {
            curA = curA.next;
        }
        while (curA != null) {
            if (curA == curB) {
                return curA;
            }
            curA = curA.next;
            curB = curB.next;
        }
        return null;

    }
}

题目4

 

public class Solution {
    public ListNode detectCycle(ListNode head) {
        ListNode slow = head;
        ListNode fast = 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 index1;
            }
        }
        return null;
    }
}