增加面试题

Author: tujietg

.idea/workspace.xml

@@ -0,0 +1,16 @@
+package LinkedList;
+
+/**
+ * @author tujietg
+ * @date 6/11/20 9:38 AM
+ */
+public class No876 {
+    public ListNode middleNode(ListNode head) {
+        ListNode slow = head, fast = head;
+        while (fast != null && fast.next != null) {
+            slow = slow.next;
+            fast = fast.next.next;
+        }
+        return slow;
+    }
+}

LinkedList/No876.java

@@ -0,0 +1,19 @@
+package LinkedList;
+
+/**
+ * @author tujietg
+ * @date 6/11/20 2:08 PM
+ */
+public class Nom24 {
+    public ListNode swapPairs(ListNode head) {
+        if (head == null || head.next == null) {
+            return head;
+        }
+        ListNode oneNode = head;
+        ListNode twoNode = head.next;
+
+        oneNode.next = swapPairs(twoNode.next);
+        twoNode.next = oneNode;
+        return twoNode;
+    }
+}

LinkedList/Nom24.java

@@ -0,0 +1,36 @@
+package LinkedList;
+
+/**
+ * @author tujietg
+ * @date 6/11/20 11:37 AM
+ */
+public class Nom27 {
+    /**
+     * Definition for singly-linked list.
+     * public class ListNode {
+     * int val;
+     * ListNode next;
+     * ListNode(int x) {
+     * val = x;
+     * next = null;
+     * }
+     * }
+     */
+    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+        ListNode a1 = headA, b1 = headB;
+        while (a1 != b1) {
+            if (a1 == null) {
+                a1 = headB;
+            } else {
+                a1 = a1.next;
+            }
+
+            if (b1 == null) {
+                b1 = headA;
+            } else {
+                b1 = b1.next;
+            }
+        }
+        return a1;
+    }
+}