题目
题解
- 广度优先遍历+哈希表
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool findTarget(TreeNode* root, int k) {
if(!root)
return false;
queue<TreeNode*> que;
unordered_set<int> value;
que.push(root);
while(!que.empty()){
auto node=que.front();
que.pop();
if(value.find(k-(node->val))!=value.end())
return true;
value.insert(node->val);
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
return false;
}
};