Commitba663fe

committed

2020-09-29

1 parentdac0734 commitba663feCopy full SHA for ba663fe

File tree

6 files changed

+44

-53

lines changed

0100.相同的树
- 0100-相同的树.py
0101.对称二叉树
- 0101-对称二叉树.py
0112.路径总和
- 0112-路径总和.py
0113.路径总和II
- 0113-路径总和II.py
0222.完全二叉树的节点个数
- 0222-完全二叉树的节点个数.py
0226.翻转二叉树
- 0226-翻转二叉树.py

6 files changed

+44

-53

lines changed

`‎0100.相同的树/0100-相同的树.py`

Lines changed: 3 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,6 +13,8 @@ def isSameTree(self, p, q):`
`13`	`13`	`"""`
`14`	`14`	`ifnotpandnotq:`
`15`	`15`	`returnTrue`
`16`		`-ifnotpornotq:`
	`16`	`+ifnotpandq:`
`17`	`17`	`returnFalse`
	`18`	`+ifpandnotq:`
	`19`	`+returnFalse`
`18`	`20`	`returnp.val==q.valandself.isSameTree(p.left,q.left)andself.isSameTree(p.right,q.right)`

`‎0101.对称二叉树/0101-对称二叉树.py`

Lines changed: 10 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,11 +11,14 @@ def isSymmetric(self, root):`
`11`	`11`	`:type root: TreeNode`
`12`	`12`	`:rtype: bool`
`13`	`13`	`"""`
`14`		`-defhelper(node1,node2):`
`15`		`-ifnotnode1:`
`16`		`-returnnotnode2`
`17`		`-ifnotnode2:`
`18`		`-returnnotnode1`
`19`		`-returnnode1.val==node2.valandhelper(node1.left,node2.right)andhelper(node1.right,node2.left)`
`20`	`14`
`21`		`-returnhelper(root,root)`
	`15`	`+defisSame(node1,node2):`
	`16`	`+ifnotnode1andnotnode2:`
	`17`	`+returnTrue`
	`18`	`+ifnotnode1andnode2:`
	`19`	`+returnFalse`
	`20`	`+ifnode1andnotnode2:`
	`21`	`+returnFalse`
	`22`	`+returnnode1.val==node2.valandisSame(node1.left,node2.right)andisSame(node1.right,node2.left)`
	`23`	`+`
	`24`	`+returnisSame(root,root)`

`‎0112.路径总和/0112-路径总和.py`

Lines changed: 10 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,8 +12,13 @@ def hasPathSum(self, root, sum):`
`12`	`12`	`:type sum: int`
`13`	`13`	`:rtype: bool`
`14`	`14`	`"""`
`15`		`-ifnotroot:`
`16`		`-returnFalse`
`17`		`-ifnotroot.leftandnotroot.right:`
`18`		`-returnroot.val==sum`
`19`		`-returnself.hasPathSum(root.left,sum-root.val)orself.hasPathSum(root.right,sum-root.val)`
	`15`	`+defdfs(node,s):`
	`16`	`+ifnotnode:`
	`17`	`+returnFalse`
	`18`	`+`
	`19`	`+s+=node.val`
	`20`	`+ifnotnode.leftandnotnode.right:`
	`21`	`+returns==sum`
	`22`	`+returndfs(node.left,s)ordfs(node.right,s)`
	`23`	`+`
	`24`	`+returndfs(root,0)`

`‎0113.路径总和II/0113-路径总和II.py`

Lines changed: 11 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,25 +6,23 @@`
`6`	`6`	`# self.right = None`
`7`	`7`
`8`	`8`	`classSolution(object):`
`9`		`-defpathSum(self,root,s):`
	`9`	`+defpathSum(self,root,sum):`
`10`	`10`	`"""`
`11`	`11`	`:type root: TreeNode`
`12`	`12`	`:type sum: int`
`13`	`13`	`:rtype: List[List[int]]`
`14`	`14`	`"""`
`15`	`15`	`res= []`
`16`		`-defdfs(node,path):`
	`16`	`+defdfs(node,path,s):`
`17`	`17`	`ifnotnode:`
`18`		`-return`
	`18`	`+return []`
	`19`	`+s+=node.val`
	`20`	`+ifnotnode.leftandnotnode.right:`
	`21`	`+ifs==sum:`
	`22`	`+res.append(path+ [node.val])`
`19`	`23`
`20`		`-path+= [node.val]`
`21`		`-ifnotnode.leftandnotnode.rightandsum(path)==s:`
`22`		`-res.append(path[:])`
`23`		`-`
`24`		`-dfs(node.left,path)`
`25`		`-dfs(node.right,path)`
`26`		`-`
`27`		`-path.pop()`
`28`		`-`
`29`		`-dfs(root, [])`
	`24`	`+dfs(node.left,path+ [node.val],s)`
	`25`	`+dfs(node.right,path+ [node.val],s)`
	`26`	`+`
	`27`	`+dfs(root, [],0)`
`30`	`28`	`returnres`

`‎0222.完全二叉树的节点个数/0222-完全二叉树的节点个数.py`

Lines changed: 5 additions & 23 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,26 +11,8 @@ def countNodes(self, root):`
`11`	`11`	`:type root: TreeNode`
`12`	`12`	`:rtype: int`
`13`	`13`	`"""`
`14`		`-ifnotroot:`
`15`		`-return0`
`16`		`-`
`17`		`-self.leavesCnt=0`
`18`		`-self.height=0`
`19`		`-self.flag=0`
`20`		`-defdfs(node,layer):`
`21`		`-ifnotnodeorself.flag:`
`22`		`-return`
`23`		`-ifnotnode.leftandnotnode.right:`
`24`		`-`
`25`		`-self.height=max(self.height,layer)`
`26`		`-iflayer<self.height:`
`27`		`-self.flag=1`
`28`		`-else:`
`29`		`-self.leavesCnt+=1`
`30`		`-return`
`31`		`-dfs(node.left,layer+1)`
`32`		`-dfs(node.right,layer+1)`
`33`		`-`
`34`		`-dfs(root,0)`
`35`		`-# print self.leavesCnt`
`36`		`-returnself.leavesCnt+sum([2**iforiinrange(self.height)] )`
	`14`	`+defdfs(node):`
	`15`	`+ifnotnode:`
	`16`	`+return0`
	`17`	`+return1+dfs(node.left)+dfs(node.right)`
	`18`	`+returndfs(root)`

`‎0226.翻转二叉树/0226-翻转二叉树.py`

Lines changed: 5 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -13,8 +13,9 @@ def invertTree(self, root):`
`13`	`13`	`"""`
`14`	`14`	`ifnotroot:`
`15`	`15`	`returnroot`
`16`		`-left=root.left`
`17`		`-right=root.right`
`18`		`-root.left=self.invertTree(right)`
`19`		`-root.right=self.invertTree(left)`
	`16`	`+left=self.invertTree(root.left)`
	`17`	`+right=self.invertTree(root.right)`
	`18`	`+`
	`19`	`+root.left=right`
	`20`	`+root.right=left`
`20`	`21`	`returnroot`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commitba663fe

File tree

6 files changed

6 files changed

`‎0100.相同的树/0100-相同的树.py`

`‎0101.对称二叉树/0101-对称二叉树.py`

`‎0112.路径总和/0112-路径总和.py`

`‎0113.路径总和II/0113-路径总和II.py`

`‎0222.完全二叉树的节点个数/0222-完全二叉树的节点个数.py`

`‎0226.翻转二叉树/0226-翻转二叉树.py`

0 commit comments