查找与目标最接近的可能数组值总和的逻辑

def closest_subset_sum(arr, target):
    n = len(arr)
    dp = [[False for _ in range(target + 1)] for _ in range(n + 1)]
    
    # 初始化dp数组
    for i in range(n + 1):
        dp[i][0] = True
    
    closest_sum = 0
    for i in range(1, n + 1):
        for j in range(1, target + 1):
            if arr[i - 1] <= j:
                dp[i][j] = dp[i - 1][j] or dp[i - 1][j - arr[i - 1]]
            else:
                dp[i][j] = dp[i - 1][j]
            
            # 更新最接近的和
            if dp[i][j] and abs(j - target) < abs(closest_sum - target):
                closest_sum = j
    
    return closest_sum

# 示例
arr = [1, 2, 3, 4, 5]
target = 10
print("最接近目标值的子集和为:", closest_subset_sum(arr, target))