Number of Good Leaf Nodes Pairs

Given the root of a binary tree and an integer distance. A pair of two different leaf nodes of a binary tree is said to be good if the length of the shortest path between them is less than or equal to distance.

Return the number of good leaf node pairs in the tree.

Example 1:

Input: root = [1,2,3,null,4], distance = 3
Output: 1
Explanation: The leaf nodes of the tree are 3 and 4 and the length of the shortest path between them is 3. This is the only good pair.

思路：divide and conquer, 往上返回的是目前节点下面，所有叶子leaf的depth 信息,list;

/**
 * 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 int countPairs(TreeNode root, int distance) {
        int[] res = new int[]{0};
        dfs(root, distance, res);
        return res[0];
    }
    
    private List<Integer> dfs(TreeNode root, int distance, int[] res) {
        if(root == null) {
            return new ArrayList<Integer>();
        }
        if(root.left == null && root.right == null) {
            List<Integer> list = new ArrayList<>();
            list.add(1);
            return list;
        }
        List<Integer> leftlist = dfs(root.left, distance, res);
        List<Integer> rightlist = dfs(root.right, distance, res);
        // update res;
        for(Integer a: leftlist) {
            for(Integer b: rightlist) {
                if(a + b <= distance) {
                    res[0]++;
                }
            }
        }
        // return curlist;
        List<Integer> curlist = new ArrayList<Integer>();
        for(Integer a: leftlist) {
            curlist.add(a + 1);
        }
        for(Integer b: rightlist) {
            curlist.add(b + 1);
        }
        return curlist;
    }
}