python凑24点

Python 可以通过使用回溯算法来解决 24 点游戏。下面是一个简单的示例代码：

def solve24(nums):
    if len(nums) == 1:
        if abs(nums - 24) < 1e-6:  # 判断与24的差距是否小于一个很小的数
            return True
        else:
            return False
    for i in range(len(nums)):
        for j in range(len(nums)):
            if i != j:
                new_nums = [nums[k] for k in range(len(nums)) if k != i and k != j]
                if solve24(new_nums + [nums[i] + nums[j]]):
                    return True
                if solve24(new_nums + [nums[i] - nums[j]]):
                    return True
                if solve24(new_nums + [nums[i] * nums[j]]):
                    return True
                if nums[j] != 0 and solve24(new_nums + [nums[i] / nums[j]]):
                    return True
    return False