跳转至

LC160 - 相交链表

IntersectionOfTwoLinkedLists.go
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
package LinkedList

type ListNode struct {
    Val  int
    Next *ListNode
}

func getIntersectionNode(headA, headB *ListNode) *ListNode {
    curA, curB := headA, headB
    lenA, lenB := 0, 0
    for ; curA != nil; curA = curA.Next {
        lenA++
    }
    for ; curB != nil; curB = curB.Next {
        lenB++
    }
    curA, curB = headA, headB
    if lenA > lenB {
        for i := 0; i < lenA-lenB; i++ {
            curA = curA.Next
        }
    } else {
        for i := 0; i < lenB-lenA; i++ {
            curB = curB.Next
        }
    }
    for curA != curB {
        curA = curA.Next
        curB = curB.Next
    }
    return curA
}