先转换为一个数组序列,然后判断是否存在两个数字,变成了一道简单题
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void dfs(TreeNode* root, vector<int>& nums)
{
if(root==NULL)
return;
dfs(root->left,nums);
nums.push_back(root->val);
dfs(root->right, nums);
}
bool findTarget(TreeNode* root, int k) {
vector<int> nums;
dfs(root, nums);
int left=0;
int right=nums.size()-1;
while(left<right){
if(nums[left]+nums[right]==k)
return true;
else if(nums[left]+nums[right]<k)
left++;
else
right--;
}
return false;
}
};