'''

解法1：利用python中与列表相关的内置函数

'''

from collections import deque

def move_numbers(numbers: list, new_numbers=deque()):

    numbers = deque(numbers)

    while len(numbers) > 0:

        if numbers[0] % 2 == 0:

            number = numbers.popleft()

            new_numbers.append(number)

        else:

            number = numbers.popleft()

            new_numbers.appendleft(number)

    print(list(new_numbers))

'''

解法2：自定义与数字相关的类与函数

'''

class Numbers:

    header = None

    tail = None

    numbers = None

    class Number:

        def __init__(self, value):

            self.value = value

            self.next = None

    def __init__(self, *args):

        self.numbers = tuple([Numbers.Number(arg) for arg in args])

        self.install(self.numbers)

    def install(self, args: tuple):

        for i in range(len(args)):

            number = args[i]

            if i == 0 and len(args) > 1:

                number.next = args[i + 1]

                self.header = number

            if i > 0 and i < len(args) - 1:

                number.next = args[i + 1]

            if i == len(args) - 1 and len(args) > 1:

                self.tail = number

    def show(self):

        subs = []

        index = self.header

        while index:

            subs.append(index.value)

            index = index.next

        print(subs)

    def move(self):

        index = self.header

        new_header = None

        for i in range(len(self.numbers)):

            _next = index.next

            if index.value % 2 == 0:

                index.next = None

                self.tail.next = index

                self.tail = index

            if index.value % 2 != 0 and i != 0:

                if new_header:

                    index.next = new_header

                    new_header = index

                else:

                    new_header = index

                    new_header.next = self.header

                self.header = new_header

            index = _next

        self.show()

'''

题目：

    遇到奇数移动到最前面

    遇到偶数移动到最后面

'''

if __name__ == '__main__':

    numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]

    # 解法1

    move_numbers(numbers)

    # 解法2

    Numbers(*numbers).move()