637 Average of Levels in Binary Tree // Double sum = 0.0; not int sum = 0; class Solution { public List<Double> averageOfLevels(TreeNode root) { Queue<TreeNode> queue = new LinkedList<>(); List<Double> result = new ArrayList<>(); queue.offer(root); while(!queue.isEmpty()){ int size = queue.size(); Double sum = 0.0; // Double sum = 0.0; not int sum = 0; for(int i = 0; i < size; i++){ TreeNode cur = queue.poll(); sum += cur.val; if(cur.left != null) queue.offer(cur.left); if(cur.right != null) queue.offer(cur.right); } result.add(sum / size); } return result; } }
637 Average of Levels in Binary Tree
猜你喜欢
转载自www.cnblogs.com/tobeabetterpig/p/9450503.html
今日推荐
周排行