获取所有数组[1，1，1，1，1，0，0，0，0]的排列

def permute(nums):
    result = []
    path = []
    used = [False] * len(nums)
    backtrack(nums, result, path, used)
    return result

def backtrack(nums, result, path, used):
    if len(path) == len(nums):
        result.append(path[:])
        return
    
    for i in range(len(nums)):
        if not used[i]:
            path.append(nums[i])
            used[i] = True
            backtrack(nums, result, path, used)
            path.pop()
            used[i] = False

nums = [1, 1, 1, 1, 1, 0, 0, 0, 0]
result = permute(nums)
print(result)