[LeetCode]679. 24 Game

最新推荐文章于 2023-03-01 03:03:48 发布

哈哈哈哈嘿嘿嘿

最新推荐文章于 2023-03-01 03:03:48 发布

阅读量2.6k

点赞数

分类专栏：【leetcode】

本文链接：https://blog.csdn.net/yuhq3/article/details/78280799

版权

【leetcode】专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种解决经典24点游戏问题的算法。利用回溯法，通过对输入的四个1到9之间的数字进行加减乘除运算，判断是否能够得到数值24。文章详细展示了算法的具体实现过程。

摘要由CSDN通过智能技术生成

Problem:

You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get the value of 24.

Example 1:

Input: [4, 1, 8, 7]
Output: True
Explanation: (8-4) * (7-1) = 24

Example 2:

Input: [1, 2, 1, 2]
Output: False

Note:

The division operator / represents real division, not integer division. For example, 4 / (1 - 2/3) = 12.
Every operation done is between two numbers. In particular, we cannot use - as a unary operator. For example, with [1, 1, 1, 1] as input, the expression -1 - 1 - 1 - 1 is not allowed.
You cannot concatenate numbers together. For example, if the input is [1, 2, 1, 2], we cannot write this as 12 + 12.

———————————————————————————————————————————————————

Solution:

题意：模拟24点游戏，给定一个只有4个元素的数组，且每个元素值在1~9之间，判断是否能通过+，-，*，/得到24.

思路：回溯。

class Solution {
public:
    bool judgePoint24(vector<int>& nums) {
        vector<double> cards(nums.size(), 0);
        for (int i = 0; i < nums.size(); i++)
            cards[i] = (double)nums[i];
        return backTracking(cards);
    }
    bool backTracking(vector<double>& cards) {
        if (cards.size() == 0)
            return false;
        if (cards.size() == 1)
            return abs(cards[0] - 24) < 1e-6;
        
        for (int i = 0; i < cards.size(); i++) {
            for (int j = 0; j < cards.size(); j++) {
                if (i == j)
                    continue;
                
                vector<double> tempCards;
                for (int k = 0; k < cards.size(); k++)
                    if (k != i && k != j)
                        tempCards.push_back(cards[k]);
                
                // '+','*','-','/'
                for (int k = 0; k < 4; k++) {
                    if (k < 2 && j < i)
                        continue;
                    if (k == 0) tempCards.push_back(cards[i] + cards[j]);
                    else if (k == 1) tempCards.push_back(cards[i] * cards[j]);
                    else if (k == 2) tempCards.push_back(cards[i] - cards[j]);
                    else if (cards[j] == 0) continue;
                    else tempCards.push_back(cards[i] / cards[j]);
                    
                    if (backTracking(tempCards))
                        return true;
                    
                    tempCards.pop_back();
                }
            }
        }
        
        return false;
    }
};