-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
653.cpp
90 lines (84 loc) · 2.13 KB
/
653.cpp
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
83
84
85
86
87
88
89
90
__________________________________________________________________________________________________
sample 28 ms submission
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
static int x = [](){
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
return NULL;
}();
class Solution {
public:
bool findTarget(TreeNode* root, int k) {
if (!root) return k == 0;
//TreeNode* node = root;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
TreeNode* node = q.front();
q.pop();
int val = k - node -> val;
TreeNode* tmp = root;
if (val != node -> val) {
while (tmp) {
if (tmp -> val == val) return true;
else if (tmp -> val < val) tmp = tmp -> right;
else tmp = tmp -> left;
}
}
if (node -> left) q.push(node -> left);
if (node -> right) q.push(node -> right);
}
return false;
}
};
__________________________________________________________________________________________________
sample 25148 kb submission
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
auto io = []() {
std::cin.tie(0);
std::cin.sync_with_stdio(0);
std::cout.tie(0);
return 0;
}();
class Solution {
std::vector<int> v;
public:
void build_list(TreeNode* root) {
if (root == nullptr) return;
build_list(root->left);
v.push_back(root->val);
build_list(root->right);
}
bool findTarget(TreeNode* root, int k) {
build_list(root);
int l{}, r{v.size() - 1};
while (l < r) {
int sum_ = v[l] + v[r];
if (sum_ == k) return true;
if (sum_ > k) {
--r;
} else {
++l;
}
}
return false;
}
};
__________________________________________________________________________________________________