将数组拆分为相等和的相邻子数组

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

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

    target = total_sum // n

    dp = [[False] * (target + 1) for _ in range(n + 1)]
    dp[0][0] = True

    for i in range(1, n + 1):
        dp[i][0] = True

    for i in range(1, n + 1):
        for j in range(1, target + 1):
            dp[i][j] = dp[i - 1][j]
            if j >= nums[i - 1]:
                dp[i][j] = dp[i][j] or dp[i - 1][j - nums[i - 1]]

    if not dp[n][target]:
        return []

    result = []
    i, j = n, target
    while i > 0 and j > 0:
        if dp[i - 1][j]:
            i -= 1
        else:
            result.append(nums[i - 1])
            j -= nums[i - 1]
            i -= 1

    return result[::-1]