We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6ac9fdf commit 6a7571cCopy full SHA for 6a7571c
C++/minimum-flips-in-binary-tree-to-get-result.cpp
@@ -6,8 +6,7 @@ class Solution {
6
public:
7
int minimumFlips(TreeNode* root, bool result) {
8
static const int INF = numeric_limits<int>::max();
9
- static unordered_map<int, function<int(int, int)>> OP =
10
- {
+ static unordered_map<int, function<int(int, int)>> OP = {
11
{2, [](int x, int y) { return x | y; }},
12
{3, [](int x, int y) { return x & y; }},
13
{4, [](int x, int y) { return x ^ y; }},
@@ -58,8 +57,7 @@ class Solution2 {
58
57
59
60
61
62
63
64
65
0 commit comments