leetcode刷题笔记(Golang)--160. Intersection of Two Linked Lists

最新推荐文章于 2020-08-23 10:51:53 发布

原创最新推荐文章于 2020-08-23 10:51:53 发布 · 1.3k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode刷题笔记(Golang)

这是一个关于使用Golang解决LeetCode问题160的笔记，目标是找到两个链表相交的起点。文章给出了几个示例解释了如何计算相交节点及其值，并强调了链表结构在解决问题时的保持不变性，以及期望的线性时间和常量空间复杂度。

160. Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:
在这里插入图片描述

begin to intersect at node c1.

Example 1:

在这里插入图片描述
Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: The intersected node’s value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.

Example 2:

在这里插入图片描述
Input: intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
Output: Reference of the node with value = 2
Input Explanation: The intersected node’s value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.

Example 3:

在这里插入图片描述
Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
Output: null
Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values.
Explanation: The two lists do not intersect, so return null.

Notes:

If the two linked lists have no intersection at all, return null.
The linked lists must retain their original structure after the function returns.
You may assume there are no cycles anywhere in the entire linked structure.
Your code should preferably run in O(n) time and use only O(1) memory.

func getIntersectionNode(headA, headB *ListNode) *ListNode {
	if headA == nil || headB == nil {
		return nil
	}
	lgA := 0
	lgB := 0
	node := headA
	for node != nil {
		lgA++
		node = node.Next
	}
	node = headB
	for node != nil {
		lgB++
		node = node.Next
	}
	longNode := headA
	shortNode := headB
	diff := lgA - lgB
	if lgA < lgB {
		longNode = headB
		shortNode = headA
		diff = lgB - lgA
	}
	for i := 0; i < diff; i++ {
		longNode = longNode.Next
	}
	for longNode != nil && shortNode != nil {
		if longNode == shortNode {
			return longNode
		}
		longNode = longNode.Next
		shortNode = shortNode.Next
	}
	return nil 
}

标签

#leetcode #go