python归并排序理解不了_PYTHON 归并排序,求排错!

defmerge(left,right):result=[]i,j=0,0whilei

def merge(left,right):

result = []

i,j = 0, 0

while i < len(left) and j < len(right):

if left[i] <= right[j]:

result.append(left[i])

i = i + 1

else:

result.append(right[j])

j = j + 1

while (i < len(left)):

result.append(left[i])

i = i + 1

while (j < len(right)):

result.append(right[j])

j = j + 1

return(result)

def mergsort(L):

print(L)

if len(L) < 2:

print(L[:])

else:

middle = len(L)/2

left = mergsort(L[:int(middle)])

right = mergsort(L[int(middle):])

together = merge(left,right)

print(together)

return(together)

错误信息:

Traceback (most recent call last):

File "", line 1, in

mergsort(M)

File "C:/Python33/bobble sort.py", line 62, in mergsort

left = mergsort(L[:int(middle)])

File "C:/Python33/bobble sort.py", line 62, in mergsort

left = mergsort(L[:int(middle)])

File "C:/Python33/bobble sort.py", line 64, in mergsort

together = merge(left,right)

File "C:/Python33/bobble sort.py", line 39, in merge

while i < len(left) and j < len(right):

TypeError: object of type 'NoneType' has no len()

mergort 有问题 不知道怎么能一直分割 跪求各位解答!

展开

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值