LintCode:重哈希

116 篇文章 0 订阅

LintCode:重哈希

"""
Definition of ListNode
class ListNode(object):

    def __init__(self, val, next=None):
        self.val = val
        self.next = next
"""
class Solution:
    """
    @param hashTable: A list of The first node of linked list
    @return: A list of The first node of linked list which have twice size
    """
    def rehashing(self, hashTable):
        # write your code here
        m = len(hashTable)
        ans = [None for i in range(2 * m)]
        for head in hashTable:
            if head == None:
                pass
            else:
                p1 = head
                while p1 != None:
                    n = p1.val % (2 * m)
                    if ans[n] == None:
                        ans[n] = ListNode(p1.val)
                    else:
                        p2 = ans[n]
                        tmp_node = ListNode(p1.val)
                        while p2.next != None:
                            p2 = p2.next
                        p2.next = tmp_node
                    p1 = p1.next
        return ans
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值