2019-06-08剑指 前奇后偶

冒泡

    def reOrderArray(self, array):
        for i in range(len(array)):
            isC = False
            for j in range(len(array) - i-1):
                if array[j]%2==0 and array[j+1]%2==1:
                    t = array[j]
                    array[j] = array[j+1]
                    array[j+1] = t
                    isC=True
            if isC==False:break
        return array

插入排序

    def reOrderArray(self, array):
        for i in range(len(array)):
            if array[i]%2==1:
                key=array[i]
                j=i-1
                while array[j]%2==0 and j>=0:
                    array[j+1]=array[j]
                    j-=1
                array[j+1]=key  #最关键的一点在于最后边界条件，最小怎么办
        return array