-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path18_24_Game.cpp
More file actions
82 lines (66 loc) · 2.34 KB
/
Copy path18_24_Game.cpp
File metadata and controls
82 lines (66 loc) · 2.34 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
// 679. 24 Game
// You are given an integer array cards of length 4. You have four cards, each containing a number in the range [1, 9]. You should arrange the numbers on these cards in a mathematical expression using the operators ['+', '-', '*', '/'] and the parentheses '(' and ')' to get the value 24.
// You are restricted with the following rules:
// The division operator '/' represents real division, not integer division.
// For example, 4 / (1 - 2 / 3) = 4 / (1 / 3) = 12.
// Every operation done is between two numbers. In particular, we cannot use '-' as a unary operator.
// For example, if cards = [1, 1, 1, 1], the expression "-1 - 1 - 1 - 1" is not allowed.
// You cannot concatenate numbers together
// For example, if cards = [1, 2, 1, 2], the expression "12 + 12" is not valid.
// Return true if you can get such expression that evaluates to 24, and false otherwise.
// Example 1:
// Input: cards = [4,1,8,7]
// Output: true
// Explanation: (8-4) * (7-1) = 24
// Example 2:
// Input: cards = [1,2,1,2]
// Output: false
// Constraints:
// cards.length == 4
// 1 <= cards[i] <= 9
class Solution
{
public:
bool judgePoint24(vector<int> &cards)
{
vector<double> nums(cards.begin(), cards.end());
return solve(nums);
}
private:
bool solve(vector<double> &nums)
{
if (nums.size() == 1)
{
return fabs(nums[0] - 24.0) < 1e-6;
}
int n = nums.size();
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (i == j)
continue;
vector<double> next;
for (int k = 0; k < n; k++)
{
if (k != i && k != j)
next.push_back(nums[k]);
}
double a = nums[i], b = nums[j];
vector<double> results = {a + b, a - b, b - a, a * b};
if (fabs(b) > 1e-6)
results.push_back(a / b);
if (fabs(a) > 1e-6)
results.push_back(b / a);
for (double val : results)
{
next.push_back(val);
if (solve(next))
return true;
next.pop_back();
}
}
}
return false;
}
};