两数之和 IV - 输入 BST

题目

题源

代码

class Solution {
    List<Integer> al = new ArrayList<>();

    public boolean findTarget(TreeNode root, int k) {
        if (root == null) return false;     
        TreeNode2ArrayList(root);
        int i = 0, j = al.size() - 1;
        while (i < j) {
            int sum = al.get(i) + al.get(j);
            if (sum == k) {
                return true;
            } else if (sum < k) {
                i++;
            } else {
                j--;
            }
        }
        return false;
    }
    private void TreeNode2ArrayList(TreeNode root) {
        if (root == null) return;
        TreeNode2ArrayList(root.left);
        al.add(root.val);
        TreeNode2ArrayList(root.right);
    }
}