python链表——链表交叉

最新推荐文章于 2022-05-13 21:58:25 发布

行走_

最新推荐文章于 2022-05-13 21:58:25 发布

阅读量295

点赞数 1

分类专栏： Python

本文链接：https://blog.csdn.net/chenlibao0823/article/details/96695467

版权

Python 专栏收录该内容

46 篇文章 2 订阅

订阅专栏

思路

1. 首尾相接法，如果交叉，则尾结点相同

2. 遍历获得尾结点，以及两个链表长度n1, n2，并将长链向前移动 |n1-n2| 步，这样同时向前遍历后，第一次相遇的点就是交叉点了。

代码

def isIntersect(head1, head2):
    if head1 is None or head2 is None or head1.next is None or head2.next is None:
        return None
    end1 = head1.next
    end2 = head2.next
    n1 = 0
    n2 = 0
    # 找到尾结点
    while end1.next:
        end1 = end1.next
        n1 += 1
    while end2.next:
        end2 = end2.next
        n2 += 1
    # 尾结点相等，说明有交叉
    if end1 == end2:
        # 长链向前移动|n1-n2|步
        if n1 > n2:
            while n1 > n2:
                head1 = head1.next
                n1 -= 1
        else:
            while n1 < n2:
                head2 = head2.next
                n2 -= 1
        # 同时移动，第一次相遇处，即为交叉点
        while head1 != head2:
            head1 = head1.next
            head2 = head2.next
        return head1
    else:
        return None


# 测试
test_head1 = Node(None)
test_head2 = Node(None)

cur1 = test_head1
i = 1
tmp = None
p = None
while i < 8:
    tmp = Node(i)
    tmp.next = None
    cur1.next = tmp
    cur1 = tmp
    if i == 5:
        p = tmp
    i += 1

cur2 = test_head2
j = 1
while j < 5:
    tmp = Node(j)
    cur2.next = tmp
    cur2 = tmp
    j += 1

# 5的位置为交叉点
cur2.next = p


interNode = isIntersect(test_head1, test_head2)
print(interNode)