中级农民
- 积分
- 155
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2014-4-17
- 最后登录
- 1970-1-1
|
写了下code,感觉如果可以用arraylist的话就比较简单了
- static class TreeNode {
- TreeNode left;
- TreeNode right;
- int val;
- public TreeNode(int val) {
- this.val = val;
- }
- }
- public static List<TreeNode> getTwoSumInBST(TreeNode root, int target) {
- List<TreeNode> res = new ArrayList<TreeNode>();
- List<TreeNode> nodes = new ArrayList<TreeNode>();
- getNodes(root, nodes);
- int left = 0;
- int right = nodes.size() - 1;
- while (left < right) {
- int sum = nodes.get(left).val + nodes.get(right).val;
- if (sum == target) {
- res.add(nodes.get(left));
- res.add(nodes.get(right));
- for (TreeNode n : res) {
- System.out.println(n.val);
- }
- return res;
- } else if (sum > target) {
- right--;
- } else {
- left++;
- }
- }
-
- return res;
- }
-
-
- private static void getNodes(TreeNode root, List<TreeNode> nodes) {
- if (root == null) {
- return;
- }
- getNodes(root.left, nodes);
- nodes.add(root);
- getNodes(root.right, nodes);
- }
复制代码 |
|