Commit5d2d00b

committed

refactor 1302

1 parent541ddc7 commit5d2d00bCopy full SHA for 5d2d00b

File tree

-21

lines changed

-21

lines changed

Lines changed: 0 additions & 21 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,27 +5,6 @@`
`5`	`5`	`importjava.util.LinkedList;`
`6`	`6`	`importjava.util.Queue;`
`7`	`7`
`8`		`-/**`
`9`		`- * 1302. Deepest Leaves Sum`
`10`		`- *`
`11`		`- * Given a binary tree, return the sum of values of its deepest leaves.`
`12`		`- *`
`13`		`- * Example 1:`
`14`		`- * 1`
`15`		`- * / \`
`16`		`- * 2 3`
`17`		`- * / \ \`
`18`		`- * 4 5 6`
`19`		`- * / \`
`20`		`- * 7 8`
`21`		`- *`
`22`		`- * Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]`
`23`		`- * Output: 15`
`24`		`- *`
`25`		`- * Constraints:`
`26`		`- * The number of nodes in the tree is between 1 and 10^4.`
`27`		`- * The value of nodes is between 1 and 100.`
`28`		`- * */`
`29`	`8`	`publicclass_1302 {`
`30`	`9`	`publicstaticclassSolution1 {`
`31`	`10`	`publicintdeepestLeavesSum(TreeNoderoot) {`

Comments

(0)