python 单链表查找元素_如何在python中一次找到链表的中间元素?

我合并了所有的方法,为您创建,查找和打印。class Node(object):

def __init__(self, data=None, next=None):

self.data = data

self.next = next

def __str__(self):

return str(self.data)

def create_linked_list(n):

"""Creating linked list for the given

size"""

linked_list = Node(1)

head = linked_list

for i in range(2, n):

head.next = Node(i)

head = head.next

return linked_list

def print_linked_list(node):

"""To print the linked list in forward"""

while node:

print '[',node,']','[ref] ->',

node = node.next

print '-> None'

def find_middle1(node):

tick = False

half = node

while node:

node = node.next

if tick:

half = half.next

tick = not tick

return "Middle node is %s" % str(half)

def find_middle2(node):

list = []

while node:

list.append(node)

node = node.next

return "Middle node is %s" % str(list[len(list)/2])

node = create_linked_list(10)

print_linked_list(node)

print find_middle1(node)

print find_middle2(node)

输出:[ 1 ] [ref] -> [ 2 ] [ref] -> [ 3 ] [ref] -> [ 4 ] [ref] -> [ 5 ] [ref] -> [ 6 ] [ref] -> [ 7 ] [ref] -> [ 8 ] [ref] -> [ 9 ] [ref] -> -> None

Middle node is 5

Middle node is 5

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值