def reverse(lst):
i, j = 0, len(lst)-1
while i < j:
temp = lst[i]
lst[i] = lst[j]
lst[j] = temp
i += 1
j -= 1
return lst
T(n)=O(n/2)
def reverse(lst):
i, j = 0, len(lst)-1
while i < j:
temp = lst[i]
lst[i] = lst[j]
lst[j] = temp
i += 1
j -= 1
return lst
T(n)=O(n/2)
转载于:https://www.cnblogs.com/lazySmeagol/p/7150879.html