【2022初春】【LeetCode】653. 两数之和 IV - 输入 BST

思路对了，但是两数之和记得用双指针！

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean findTarget(TreeNode root, int k) {        
        List<Integer> l = new ArrayList<>();
        inorder(root,l);
        int i=0,j=l.size()-1;
        while(i<j){
            if(l.get(i)+l.get(j)<k) i++;
            else if(l.get(i)+l.get(j)>k) j--;
            else return true;
        }
        return false;
    }
    void inorder(TreeNode root,List<Integer> l){
        if(root==null) return ;
        inorder(root.left,l);
        l.add(root.val);
        inorder(root.right,l);
    }
}