Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

update the format

Browse Source
This commit is contained in:
haiker2011 2018-09-27 20:38:17 +08:00
parent 1b72a42820
commit ec18d6f301
1 changed files with 17 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
notes/面试总结.md
View File

@ -538,23 +538,23 @@ public TreeLinkNode GetNext(TreeLinkNode pNode) {
```python ```python
def GetNext(self, pNode): def GetNext(self, pNode):
# write code here # write code here
# pNode is None # pNode is None
if not pNode: if not pNode:
return pNode return pNode
if pNode.right: if pNode.right:
node = pNode.right node = pNode.right
while node.left: while node.left:
node = node.left node = node.left
return node return node
else: else:
while pNode.next: while pNode.next:
parent = pNode.next parent = pNode.next
if parent.left == pNode: if parent.left == pNode:
return parent return parent
pNode = pNode.next pNode = pNode.next
# pNode not have the next node # pNode not have the next node
return None return None
``` ```
# 9. 用两个栈实现队列 # 9. 用两个栈实现队列