AC https://leetcode-cn.com/problems/intersection-of-two-linked-lists

Author: AaronLinRC

src/main/kotlin/leetcode/intersection-of-two-linked-lists/Solution.kt

@@ -0,0 +1,36 @@
+package leetcode.`intersection-of-two-linked-lists`
+
+import ListNode
+import org.junit.Test
+import util.ListNodeUtil
+
+class Solution {
+    fun getIntersectionNode(headA: ListNode?, headB: ListNode?): ListNode? {
+        var pA = headA
+        while (pA?.next != null) {
+            if (headB == pA) return headB
+            pA = pA.next
+        }
+        if (pA == headB) return headB
+        pA?.next = headA
+        val endA = pA
+        var slowP = headB
+        var fastP = headB
+        while ((slowP != fastP && slowP != null && fastP != null) || slowP == headB) {
+            slowP = slowP?.next
+            fastP = fastP?.next?.next
+        }
+        slowP = headB
+        while ((slowP != fastP && slowP != null && fastP != null) || slowP == headB) {
+            slowP = slowP?.next
+            fastP = fastP?.next
+        }
+        endA?.next = null
+        return fastP
+    }
+
+    @Test
+    fun test(){
+        val list1 = ListNodeUtil.generate(intArrayOf(8,4,5))
+    }
+}

src/main/kotlin/util/ListNodeUtil.kt

@@ -1,7 +1,20 @@
 package util
 
-object ListNodeUtil {
-    fun generate(){
+import ListNode
 
+object ListNodeUtil {
+    fun generate(intArray: IntArray): ListNode {
+        lateinit var head: ListNode
+        var tmp: ListNode? = null
+        intArray.forEachIndexed { index, i ->
+            if (index == 0) {
+                head = ListNode(i)
+                tmp = head
+            } else {
+                tmp?.next = ListNode(i)
+                tmp = tmp?.next
+            }
+        }
+        return head
     }
 }