ALGO-1005 数字游戏 蓝桥杯

# 此题要用到深度遍历dfs
# 全排列问题

def dfs(depth, n, sumR, arr, visted, flag):
    nums = []
    if flag[0]:        
        return
    if depth > n:
        # 此处复制数组要注意，不可直接赋值给nums
        for i in arr:
            nums.append(i)
        if numberGame(n, nums, sumR):
            flag[0] = 1
            for i in range(1, n+1):
                print(arr[i],"", end="")
        return
    else:
        for i in range(1, n+1):
            if not visted[i]:
                arr[depth] = i
                visted[i] = True
                dfs(depth+1, n, sumR, arr, visted, flag)
                visted[i] = False
    
# 判断数组是否符合条件
def numbe