文件: root - text - article - 2019 - 11 - merge-k-sorted-linked-list.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 398 次阅读, 20774 次搜索 | 98 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 398 次阅读, 20774 次搜索 | 98 个单词
![定阅此目录的博客 定阅此目录的博客](/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:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 398 次阅读, 20774 次搜索 | 98 个单词 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
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
- Sort a Partially Sorted List
- A trick for getting good at coding interviews FASTER
- [Daily Problem] Add two numbers as a linked list
- Daily Interview Puzzle: Intersection of Linked Lists
- Daily Interview Problem: Maximum Profit From Stocks
- YES!!
- [Daily Problem] Witness of The Tall People
- Daily Interview Problem: Find the k-th Largest Element in a List
©2006~2024 牛排过熟 - 0.00831 秒 - 2380.268 KB/s - 13 在线
内存: 493.71 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。