README
¶
NAME
14 - intersection of two singly linked lists
DESCRIPTION
Problem
Find an intersection of two singly linked list, i.e., a common node, shared by both lists:
Example
Input:
[1] -> [2] -+
|
v
[3] -> [4]
^
|
[5] -+
Output: Node with value 3
SEE ALSO
Documentation
¶
Index ¶
Examples ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Node ¶
type Node struct {
// contains filtered or unexported fields
}
func Find ¶
Example ¶
package main
import (
"fmt"
"github.com/skhal/lab/iq/14/intersection"
)
func main() {
shared := intersection.NewList(1, 2)
l1 := intersection.NewList(3, 4).Append(shared)
l2 := intersection.NewList(5).Append(shared)
node := intersection.Find(l1, l2)
fmt.Println(node)
}
Output: [1 2]
Source Files
Click to show internal directories.
Click to hide internal directories.