Commit009479c

authored

Update 1022. Sum of Root To Leaf Binary Numbers.go

add content of problem

1 parent24e98f4 commit009479cCopy full SHA for 009479c

File tree

+13

-0

lines changed

+13

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,16 @@`
	`1`	`+/*`
	`2`	`+Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.`
	`3`	`+`
	`4`	`+For all leaves in the tree, consider the numbers represented by the path from the root to that leaf.`
	`5`	`+`
	`6`	`+Return the sum of these numbers.`
	`7`	`+`
	`8`	`+Example 1:`
	`9`	`+Input: [1,0,1,0,1,0,1]`
	`10`	`+Output: 22`
	`11`	`+Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22`
	`12`	`+*/`
	`13`	`+`
`1`	`14`	`package main`
`2`	`15`
`3`	`16`	`typeTreeNodestruct {`

Comments

(0)