python创建一个有序链表_python 合并k个有序链表

from heapq import heappush, heappop

class Solution:

def mergeKLists(self, lists):

q = []

for i,head in enumerate(lists):

if head:

heappush(q, (head.val, i, head))

node = dummy = ListNode(0)

while q:

val, i, pop_node = heappop(q)

print(val)

node.next = ListNode(val)

node = node.next

next_node = pop_node.next

if next_node:

heappush(q, (next_node.val, i, next_node))

return dummy.next

为啥有i???????????理由见后、

另外PQ也有这个问题

# Definition for singly-linked list.

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

import queue

class Solution:

def mergeKLists(self, lists: List[ListNode]) -> ListNode:

q = queue.PriorityQueue()

for i,head in enumerate(lists):

if head:

q.put((head.val, i, head))

node = dummy = ListNode(0)

while not q.empty():

val, i, pop_node = q.get()

node.next = ListNode(val)

node = node.next

next_node = pop_node.next

if next_node:

q.put((next_node.val, i, next_node))

return dummy.next

python 3 heappush Line 13: TypeError: ‘

出现原因:

@cbmbbz In the event that two or more of the lists have the same val, this code will error out since the queue module will compare the second element in the priority queue which is a ListNode object (and this is not a comparable type).

To solve for this issue, I have stored (node.val, list_idx, node) to account for this edge case.

fromqueue import PriorityQueue

# Definition for singly-linked list.

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

def mergeKLists(self, lists):

k = len(lists)

q = PriorityQueue(maxsize=k)

dummy = ListNode(None)

curr = dummy

for list_idx, node in enumerate(lists):

if node: q.put((node.val, list_idx, node))

while q.qsize() > 0:

poped = q.get()

curr.next, list_idx = poped[2], poped[1]

curr = curr.next

if curr.next: q.put((curr.next.val, list_idx, curr.next))

return dummy.next

48

Show 4 replies

Reply

Share

Report

Last Edit: October 11, 2018 9:42 PM

Read More

Python3 env will get TypeError: ‘

if there are duplicate values in the list. Works in Python env.

原文:https://www.cnblogs.com/bonelee/p/12379914.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值