Commit02b74a0

authored

Update Count Nodes Equal to Average of Subtree.java

1 parent220c742 commit02b74a0Copy full SHA for 02b74a0

File tree

+17

-18

lines changed

+17

-18

lines changed

Lines changed: 17 additions & 18 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,24 +14,23 @@`
`14`	`14`	`* }`
`15`	`15`	`*/`
`16`	`16`	`classSolution {`
`17`		`-publicintaverageOfSubtree(TreeNoderoot) {`
`18`		`-int[]result = {0};`
`19`		`-helper(root,result);`
`20`		`-returnresult[0];`
`21`		`- }`
`22`		`-`
`23`		`-privateint[]helper(TreeNoderoot,int[]result) {`
`24`		`-if (root ==null) {`
`25`		`-returnnewint[]{0,0};`
	`17`	`+publicintaverageOfSubtree(TreeNoderoot) {`
	`18`	`+int[]result = {0};`
	`19`	`+recurse(root,result);`
	`20`	`+returnresult[0];`
`26`	`21`	`}`
`27`		`-int[]left =helper(root.left,result);`
`28`		`-int[]right =helper(root.right,result);`
`29`		`-intsum =left[0] +right[0] +root.val;`
`30`		`-intnumOfNodes =left[1] +right[1] +1;`
`31`		`-intaverage =sum /numOfNodes;`
`32`		`-if (root.val ==average) {`
`33`		`-result[0]++;`
	`22`	`+`
	`23`	`+privateint[]recurse(TreeNoderoot,int[]result) {`
	`24`	`+if (root ==null) {`
	`25`	`+returnnewint[]{0,0};`
	`26`	`+ }`
	`27`	`+int[]left =recurse(root.left,result);`
	`28`	`+int[]right =recurse(root.right,result);`
	`29`	`+intsum =left[0] +right[0] +root.val;`
	`30`	`+intcount =left[1] +right[1] +1;`
	`31`	`+if (count !=0 &&sum /count ==root.val) {`
	`32`	`+result[0]++;`
	`33`	`+ }`
	`34`	`+returnnewint[]{sum,count};`
`34`	`35`	`}`
`35`		`-returnnewint[]{sum,numOfNodes};`
`36`		`- }`
`37`	`36`	`}`

Comments

(0)