Commit69779a7

committed

sum of left leaves

1 parent7feb354 commit69779a7Copy full SHA for 69779a7

File tree

+19

-1

lines changed

+19

-1

lines changed

Lines changed: 18 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package_20160924_6th_contest;`
	`1`	`+packageeasy;`
`2`	`2`
`3`	`3`	`importclasses.TreeNode;`
`4`	`4`
`@@ -26,4 +26,21 @@ private int dfs(TreeNode root, int result, boolean left) {`
`26`	`26`	`}`
`27`	`27`	`returnleftResult +rightResult;`
`28`	`28`	`}`
	`29`	`+`
	`30`	`+privateclassSolution_more_concise{`
	`31`	`+`
	`32`	`+publicintsumOfLeftLeaves(TreeNoderoot) {`
	`33`	`+intsum =0;`
	`34`	`+if(root ==null)returnsum;`
	`35`	`+if(root.left !=null){`
	`36`	`+if(root.left.left ==null &&root.left.right ==null)sum +=root.left.val;`
	`37`	`+elsesum +=sumOfLeftLeaves(root.left);`
	`38`	`+ }`
	`39`	`+if(root.right !=null){`
	`40`	`+sum +=sumOfLeftLeaves(root.right);`
	`41`	`+ }`
	`42`	`+returnsum;`
	`43`	`+ }`
	`44`	`+`
	`45`	`+ }`
`29`	`46`	`}`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,7 @@`
`5`	`5`	`\|419\|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)\|[Solution](../../blob/master/MEDIUM/src/medium/BattleshipsinaBoard.java) \| O(n^2) \|O(1) \| Medium\| DFS`
`6`	`6`	`\|415\|[Add Strings](https://leetcode.com/problems/add-strings/)\|[Solution](../../blob/master/EASY/src/easy/AddStrings.java)\| O(n)\|O(1)\| Easy\|`
`7`	`7`	`\|412\|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)\|[Solution](../../blob/master/EASY/src/easy/FizzBuzz.java)\| O(n)\|O(1)\| Easy\|`
	`8`	`+\|404\|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)\|[Solution](../../blob/master/EASY/src/easy/SumofLeftLeaves.java)\| O(n)\|O(h)\| Easy\|`
`8`	`9`	`\|398\|[Random Pick Index](https://leetcode.com/problems/random-pick-index/)\|[Solution](../../blob/master/MEDIUM/src/medium/RandomPickIndex.java) \| \| \| Medium\| Reservoir Sampling`
`9`	`10`	`\|397\|[Integer Replacement](https://leetcode.com/problems/integer-replacement/)\|[Solution](../../blob/master/EASY/src/easy/IntegerReplacement.java)\| ? \| ? \| Easy\| BFS`
`10`	`11`	`\|396\|[Rotate Function](https://leetcode.com/problems/rotate-function/)\|[Solution](../../blob/master/EASY/src/easy/RotateFunction.java)\| O(n^2) could be optimized to O(n)\| O(1)\| Easy\|`

Comments

(0)