将一个集合划分为两个子集，使和的差值最小，并返回这两个子集

def partition(nums):
    total_sum = sum(nums)
    n = len(nums)
    target_sum = total_sum // 2

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

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

    max_sum = 0
    for j in range(target_sum, -1, -1):
        if dp[n][j]:
            max_sum = j
            break

    subset_sum_diff = total_sum - 2 * max_sum
    return subset_sum_diff

nums = [1, 6, 11, 5]
result = partition(nums)
print(result)