Commit 0542027

committed

add 617.py

1 parent b7e4182 commit 0542027Copy full SHA for 0542027

File tree

+64

-0

lines changed

+64

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+# Definition for a binary tree node.`
	`2`	`+# class TreeNode(object):`
	`3`	`+# def __init__(self, x):`
	`4`	`+# self.val = x`
	`5`	`+# self.left = None`
	`6`	`+# self.right = None`
	`7`	`+`
	`8`	`+class Solution(object):`
	`9`	`+ def mergeTrees(self, t1, t2):`
	`10`	`+ """`
	`11`	`+ :type t1: TreeNode`
	`12`	`+ :type t2: TreeNode`
	`13`	`+ :rtype: TreeNode`
	`14`	`+ """`
	`15`	`+`
	`16`	`+ ret= None`
	`17`	`+`
	`18`	`+ if t1 and t2:`
	`19`	`+ ret = TreeNode(t1.val + t2.val)`
	`20`	`+ ret.left = self.mergeTrees(t1.left, t2.left)`
	`21`	`+ ret.right = self.mergeTrees(t1.right, t2.right)`
	`22`	`+ elif t1:`
	`23`	`+ ret = TreeNode(t1.val)`
	`24`	`+ ret.left = self.mergeTrees(t1.left, None)`
	`25`	`+ ret.right = self.mergeTrees(t1.right, None)`
	`26`	`+ elif t2:`
	`27`	`+ ret = TreeNode(t2.val)`
	`28`	`+ ret.left = self.mergeTrees(t2.left, None)`
	`29`	`+ ret.right = self.mergeTrees(t2.right, None)`
	`30`	`+`
	`31`	`+ return ret`
	`32`	`+`

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+# Definition for a binary tree node.`
	`2`	`+# class TreeNode(object):`
	`3`	`+# def __init__(self, x):`
	`4`	`+# self.val = x`
	`5`	`+# self.left = None`
	`6`	`+# self.right = None`
	`7`	`+`
	`8`	`+class Solution(object):`
	`9`	`+ def mergeTrees(self, t1, t2):`
	`10`	`+ """`
	`11`	`+ :type t1: TreeNode`
	`12`	`+ :type t2: TreeNode`
	`13`	`+ :rtype: TreeNode`
	`14`	`+ """`
	`15`	`+`
	`16`	`+ ret= None`
	`17`	`+`
	`18`	`+ if t1 and t2:`
	`19`	`+ ret = TreeNode(t1.val + t2.val)`
	`20`	`+ ret.left = self.mergeTrees(t1.left, t2.left)`
	`21`	`+ ret.right = self.mergeTrees(t1.right, t2.right)`
	`22`	`+ elif t1:`
	`23`	`+ ret = TreeNode(t1.val)`
	`24`	`+ ret.left = self.mergeTrees(t1.left, None)`
	`25`	`+ ret.right = self.mergeTrees(t1.right, None)`
	`26`	`+ elif t2:`
	`27`	`+ ret = TreeNode(t2.val)`
	`28`	`+ ret.left = self.mergeTrees(t2.left, None)`
	`29`	`+ ret.right = self.mergeTrees(t2.right, None)`
	`30`	`+`
	`31`	`+ return ret`
	`32`	`+`

Comments

(0)