快速python算法，从子集和等于给定比率的数字列表中查找所有可能的分区

def find_partitions(nums, target_ratio):
    result = []
    total_sum = sum(nums)
    target_sum = total_sum * target_ratio

    def backtrack(curr_partition, remaining_nums, curr_sum):
        if curr_sum == target_sum:
            result.append(curr_partition)
            return
        if curr_sum > target_sum:
            return

        for i in range(len(remaining_nums)):
            num = remaining_nums[i]
            remaining = remaining_nums[i+1:]
            backtrack(curr_partition + [num], remaining, curr_sum + num)

    backtrack([], nums, 0)
    return result