如何找到等于x的不同长度数组的加权组合？

def find_combinations(target, nums):
    results = []
    backtrack(target, nums, 0, 0, [], results)
    return results

def backtrack(target, nums, index, curr_sum, curr_combination, results):
    if curr_sum == target:
        results.append(curr_combination[:])
        return
    if curr_sum > target or index >= len(nums):
        return
    # 不选择当前元素
    backtrack(target, nums, index + 1, curr_sum, curr_combination, results)
    # 选择当前元素
    curr_combination.append(nums[index])
    backtrack(target, nums, index, curr_sum + nums[index], curr_combination, results)
    curr_combination.pop()

# 示例用法
target = 10
nums = [1, 2, 3, 4, 5]
result = find_combinations(target, nums)
print(result)