File: root - text - article - 2019 - 11 - merge-k-sorted-linked-list.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 423 Views, 21052 Search Bots | 98 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 423 Views, 21052 Search Bots | 98 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Twitter:
You are given an array of k sorted singly linked lists. Merge the linked lists into a single sorted linked list and return it.
Here's your starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 423 Views, 21052 Search Bots | 98 Words You are given an array of k sorted singly linked lists. Merge the linked lists into a single sorted linked list and return it.
Here's your starting point:
class Node(object):
def __init__(self, val, next=None):
self.val = val
self.next = next
def __str__(self):
c = self
answer = ""
while c:
answer += str(c.val) if c.val else ""
c = c.next
return answer
def merge(lists):
# Fill this in.
a = Node(1, Node(3, Node(5)))
b = Node(2, Node(4, Node(6)))
print merge([a, b])
# 123456
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: Decode String
- Design Tic-Tac-Toe
- [Daily Problem] Witness of The Tall People
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Progess made
- Daily Interview Problem: First Missing Positive Integer
- Daily Interview Puzzle: Intersection of Linked Lists
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
- Daily Interview Problem: Count Number of Unival Subtrees
- First and Last Indices of an Element in a Sorted Array
©2006~2024 SteakOverCooked - 0.013 Seconds(s) - 4189.014 KB/s - 28 Online
Memory: 516.81 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" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !