(Python)2048小游戏核心代码

算法思想：

1.降维：将二维降为一维列表进行处理

2.去零：相邻相同合并

list_merge = None

# 1
def zero_to_end():
    """
        零元素移动到末尾
    """
    # 思想：从后向前判断，如果发现零元素，删除并追加0
    # -1,-2,-3,-4
    for i in range(-1, -len(list_merge) - 1, -1):
        if list_merge[i] == 0:
            del list_merge[i]
            list_merge.append(0)

# zero_to_end()
# print(list_merge)

# 2
def merge():
    """
        相同数字合并
    """
    # 先将中间的零元素移动到末尾
    # 再合并相邻相同元素
    zero_to_end()
    for i in range(0, len(list_merge) - 1):
        if list_merge[i] == list_merge[i + 1]:
            # 将后一个累加到前一个之上
            list_merge[i] += list_merge[i + 1]
            del list_merge[i + 1]
            list_merge.append(0)


# merge()
# print(list_merge)


# 3
map = [
    [2, 0, 0, 2],
    [4, 4, 2, 2],
    [2, 4, 0, 4],
    [0, 0, 2, 2]
]


def move_left():
    """
        向左移动
    """
    # 思想：将二维列表中每行交给merge()函数进行操作
    for line in map:
        global list_merge
        list_merge = line
        merge()


# move_left()
# print(map)

# 4
def move_right():
    """
        向右移动
    """
    # 思想：将二维列表中每行（从右向左）交给merge()函数进行操作
    for line in map:
        global list_merge
        # 从右向左取出数据，形成了新列表
        list_merge = line[::-1]
        merge()
        # 从右向左接受合并后的数据
        line[::-1] = list_merge


# move_right()
# print(map)

# 5
def move_up():
    square_matrix_transpose(map)
    move_left()
    square_matrix_transpose(map)


def move_down():
    square_matrix_transpose(map)
    move_right()
    square_matrix_transpose(map)


# 利用方阵转置函数
def square_matrix_transpose(sqr_matrix):
    for c in range(1, len(sqr_matrix)):
        for r in range(c, len(sqr_matrix)):
            sqr_matrix[r][c - 1], sqr_matrix[c - 1][r] = sqr_matrix[c - 1][r], sqr_matrix[r][c - 1]

move_up()
print(map)
move_down()
print(map)