python改变数组的操作是_Python数组操作

使用列表数据结构并不是一种有效的方法。一个队列会更合适。在任何情况下：

使用队列>>> q = collections.deque([1,2,3,4,5,6,7,8])

>>> for _ in xrange(5):

... q.rotate(-1)

...

>>> q

deque([6, 7, 8, 1, 2, 3, 4, 5])

保留列表

^{pr2}$

或者(比前一个快)：>>> a = [1,2,3,4,5,6,7,8]

>>> for _ in xrange(5):

... a.append(a.pop(0))

...

>>> a

[6, 7, 8, 1, 2, 3, 4, 5]

在这里，您可以为您想要迭代的任何内容更改xrange。在

Timeit分析：

弹出追加>>> timeit.timeit('a.append(a.pop(0))', setup='a = [0,1,2,3,4,5,6,7,8,9]', number=1000000)

0.24548697471618652

>>> timeit.timeit('a.append(a.pop(0))', setup='a = [0,1,2,3,4,5,6,7,8,9]', number=100000000)

23.65538215637207

切片>>> timeit.timeit('a=a[1:] + a[:1]', setup='a = [0,1,2,3,4,5,6,7,8,9]', number=1000000)

0.36037278175354004

>>> timeit.timeit('a=a[1:] + a[:1]', setup='a = [0,1,2,3,4,5,6,7,8,9]', number=100000000)

35.06173801422119

排队>>> timeit.timeit('q.rotate(-1)', setup='import collections; q = collections.deque([0,1,2,3,4,5,6,7,8])', number=1000000)

0.16829514503479004

>>> timeit.timeit('q.rotate(-1)', setup='import collections; q = collections.deque([0,1,2,3,4,5,6,7,8])', number=100000000)

16.012277841567993

稍加优化，基本上去掉了append、pop和rotate的ugugetattr_uu调用：

弹出追加>>> timeit.timeit('aa(ap(0))', setup='a = [0,1,2,3,4,5,6,7,8,9]; aa=a.append; ap=a.pop', number=1000000)

0.15255093574523926

>>> timeit.timeit('aa(ap(0))', setup='a = [0,1,2,3,4,5,6,7,8,9]; aa=a.append; ap=a.pop', number=100000000)

14.50795292854309

排队>>> timeit.timeit('r(-1)', setup='import collections; q = collections.deque([0,1,2,3,4,5,6,7,8]); r=q.rotate', number=1000000)

0.13374090194702148

>>> timeit.timeit('r(-1)', setup='import collections; q = collections.deque([0,1,2,3,4,5,6,7,8]); r=q.rotate', number=100000000)

11.435136079788208