File: root - text - article - 2019 - 11 - intersection-of-linked-lists.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 457 Views, 22109 Search Bots | 136 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 457 Views, 22109 Search Bots | 136 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Apple:
You are given two singly linked lists. The lists intersect at some node. Find, and return the node. Note: the lists are non-cyclical.
Example:
This should return 3 (you may assume that any nodes with the same value are the same node).
Here is a starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Cateogry: Computing | 457 Views, 22109 Search Bots | 136 Words You are given two singly linked lists. The lists intersect at some node. Find, and return the node. Note: the lists are non-cyclical.
Example:
A = 1 -> 2 -> 3 -> 4
B = 6 -> 3 -> 4
This should return 3 (you may assume that any nodes with the same value are the same node).
Here is a starting point:
def intersection(a, b):
# fill this in.
class Node(object):
def __init__(self, val):
self.val = val
self.next = None
def prettyPrint(self):
c = self
while c:
print c.val,
c = c.next
a = Node(1)
a.next = Node(2)
a.next.next = Node(3)
a.next.next.next = Node(4)
b = Node(6)
b.next = a.next.next
c = intersection(a, b)
c.prettyPrint()
# 3 4
Related Articles
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Daily Interview Problem: Room scheduling
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Daily Interview Problem: Validate Binary Search Tree
- Maximum In A Stack
- Daily Interview Problem: Look and Say Sequence
- Two Tricks of Delphi
- [Daily Problem] Add two numbers as a linked list
- Sort a Partially Sorted List
- Algorithm Interview Question: Nth Fibonacci Number
©2006~2024 SteakOverCooked - 0.00757 Seconds(s) - 2462.552 KB/s - 33 Online Memory: 492.27 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !