算法1
class Solution(object):
def reOrderArray(self, array):
t = list()
k = list()
for i in array:
if i%2 != 0:
t.append(i)
else:
k.append(i)
m = t+k
for i in range(len(m)):
array[i] = m[i] #重新赋值给原数组
return