添加新的方法

Jack-Lee-Hiter · Jack-Lee-Hiter · commit 8336aec5cbed · 2016-08-07T22:49:29.000+08:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/Target Offer/二叉树的镜像.py b/Target Offer/二叉树的镜像.py
@@ -43,6 +43,22 @@ def Mirror2(self, root):
             if tree.right:
                 stackNode.append(tree.right)
                 nodeNum += 1
+    # 非递归实现
+    def MirrorNoRecursion(self, root):
+        if root == None:
+            return
+        nodeQue = [root]
+        while len(nodeQue) > 0:
+            curLevel, count = len(nodeQue), 0
+            while count < curLevel:
+                count += 1
+                pRoot = nodeQue.pop(0)
+                pRoot.left, pRoot.right = pRoot.right, pRoot.left
+                if pRoot.left:
+                    nodeQue.append(pRoot.left)
+                if pRoot.right:
+                    nodeQue.append(pRoot.right)
+            return
 
 pNode1 = TreeNode(8)
 pNode2 = TreeNode(6)
diff --git a/Target Offer/反转链表.py b/Target Offer/反转链表.py
@@ -24,6 +24,15 @@ def ReverseList(self, pHead):
             pPrev = pNode
             pNode = pNext
         return pReversedHead
+    # 递归实现反转链表
+    def ReverseListRec(self, pHead):
+        if not pHead or not pHead.next:
+            return pHead
+        else:
+            pReversedHead = self.ReverseList(pHead.next)
+            pHead.next.next = pHead
+            pHead.next = None
+            return pReversedHead
 
 node1 = ListNode(10)
 node2 = ListNode(11)
