LintCode 597.具有最大平均数的子树

给一棵二叉树，找到有最大平均值的子树。返回子树的根结点。

分治+遍历
分治即为在左右子树中找到有最大平均值的子树 再和整体进行比较
在分治的同时 保存每个根节点下的sum和size 同时进行打擂台比较
利用全局常量保存最大平均值以及对应根节点

public class Solution {
    
    class ResultType{
        double sum;
        int size;
        public ResultType(double sum, int size){
            this.sum = sum;
            this.size = size;
        }
    }
    private double maxAverage = -1.0 / 0;
    private TreeNode node;
    public TreeNode findSubtree2(TreeNode root) {
        helper(root);
        return node;

    }
    public ResultType helper(TreeNode root){
        if(root == null)
            return new ResultType(0,0);
        ResultType left = helper(root.left);
        ResultType right = helper(root.right);
        if((left.sum + right.sum + root.val) / (right.size + left.size + 1) > maxAverage){
            node = root;
            maxAverage = (left.sum + right.sum + root.val) / (right.size + left.size + 1);
        }
        return new ResultType(left.sum + right.sum + root.val, left.size + right.size + 1);

    }
}