将长度为n的数组(包含从1到n(无重复)的数组分成两个相等和的算法

def splitArray(nums):
    n = len(nums)
    if n == 0:
        return []

    total_sum = sum(nums)
    if total_sum % 2 != 0:
        return []

    target_sum = total_sum // 2
    visited = [False] * n
    result = []

    def backtrack(index, cur_sum, target_sum, count, result):
        if cur_sum == target_sum and count == n // 2:
            result.append(nums[:index])
            return

        if cur_sum > target_sum or count > n // 2:
            return

        for i in range(index, n):
            if not visited[i]:
                visited[i] = True
                backtrack(i + 1, cur_sum + nums[i], target_sum, count + 1, result)
                visited[i] = False
                cur_sum -= nums[i]

    backtrack(0, 0, target_sum, 0, result)
    return result

# 示例用法
nums = [1, 2, 3, 4, 5, 6]
result = splitArray(nums)
print(result)