剑指offer——第十五天（搜索与回溯算法）

第一题：剑指 Offer 34. 二叉树中和为某一值的路径

问题描述

思路

借鉴一个大佬思路

代码

/**
 * 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 {
    List<List<Integer>> res = new LinkedList<>();
    LinkedList<Integer> List = new LinkedList<>();
    public List<List<Integer>> pathSum(TreeNode root, int target) {        
        recue( root, target);
        return res;
    }
    void recue(TreeNode root,int target){
        if(root == null) return;
        List.add(root.val);
        target -= root.val;
        if(root.left == null && root.right == null && target == 0){
            res.add(new LinkedList(List));
        }   
            recue(root.left,target);
            recue(root.right,target);
            List.removeLast();
    }
}

第二题：剑指 Offer 36. 二叉搜索树与双向链表

问题描述

思路

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int k,res;
    public int kthLargest(TreeNode root, int k) {
        this.k=k;
        DFS(root);
        return res;
    }
    void DFS(TreeNode root){
        if(root == null) return;
        DFS(root.right);
        if(k==0) return;
        k--;
        res=root.val;
        DFS(root.left);
    }
}

第三题：剑指 Offer 54. 二叉搜索树的第k大节点

问题描述

思路

借鉴一个大佬的思路：

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int k,res;
    public int kthLargest(TreeNode root, int k) {
        this.k=k;
        DFS(root);
        return res;
    }
    void DFS(TreeNode root){
        if(root == null) return;
        DFS(root.right);
        if(k==0) return;
        k--;
        res=root.val;
        DFS(root.left);
    }
}