#!/usr/bin/env python
def reorder (nums):
odd = []
even = []
for i in nums:
if i % 2 == 0:
even.append(i)
else:
odd.append(i)
return odd + even
a = [1,2,3,4,5]
b = [0,5,9,2,3,6]
c = [-1,0,2,5]
d = [0,0,0,2]
e = [1,1]
f = [2]
print reorder(a)
print reorder(b)
print reorder(c)
print reorder(d)
print reorder(e)
print reorder(f)
def reorder (nums):
odd = []
even = []
for i in nums:
if i % 2 == 0:
even.append(i)
else:
odd.append(i)
return odd + even
a = [1,2,3,4,5]
b = [0,5,9,2,3,6]
c = [-1,0,2,5]
d = [0,0,0,2]
e = [1,1]
f = [2]
print reorder(a)
print reorder(b)
print reorder(c)
print reorder(d)
print reorder(e)
print reorder(f)
本文介绍了一种使用Python实现的简单算法,该算法能够将一个整数列表中的奇数元素和偶数元素进行分离并重新排序。通过几个示例展示了如何将列表中的奇数放在前面,偶数放在后面。
750

被折叠的 条评论
为什么被折叠?



