add

Jack-Lee-Hiter · Jack-Lee-Hiter · commit 9e6c23d8f45d · 2016-08-14T10:45:05.000+08:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/Target Offer/&#20108;&#21449;&#26641;&#30340;&#19979;&#19968;&#20010;&#32467;&#28857;.py b/Target Offer/&#20108;&#21449;&#26641;&#30340;&#19979;&#19968;&#20010;&#32467;&#28857;.py
@@ -26,4 +26,33 @@ def GetNext(self, pNode):
                 pCurrent = pParent
                 pParent = pCurrent.next
             pNext = pParent
+        return pNext
+
+class Solution2:
+    def GetNext(self, pNode):
+        # &#36755;&#20837;&#26159;&#19968;&#20010;&#31354;&#33410;&#28857;
+        if pNode == None:
+            return None
+        # &#27880;&#24847;&#24403;&#21069;&#33410;&#28857;&#26159;&#26681;&#33410;&#28857;&#30340;&#24773;&#20917;&#12290;&#25152;&#20197;&#22312;&#26368;&#24320;&#22987;&#35774;&#23450;pNext = None, &#22914;&#26524;&#19979;&#21015;&#24773;&#20917;&#37117;&#19981;&#28385;&#36275;, &#35828;&#26126;&#24403;&#21069;&#32467;&#28857;&#20026;&#26681;&#33410;&#28857;, &#30452;&#25509;&#36755;&#20986;None
+        pNext = None
+        # &#22914;&#26524;&#36755;&#20837;&#33410;&#28857;&#26377;&#21491;&#23376;&#26641;&#65292;&#21017;&#19979;&#19968;&#20010;&#32467;&#28857;&#26159;&#24403;&#21069;&#33410;&#28857;&#21491;&#23376;&#26641;&#20013;&#26368;&#24038;&#33410;&#28857;
+        if pNode.right:
+            pNode = pNode.right
+            while pNode.left:
+                pNode = pNode.left
+            pNext = pNode
+        else:
+            # &#22914;&#26524;&#24403;&#21069;&#33410;&#28857;&#26377;&#29238;&#33410;&#28857;&#19988;&#24403;&#21069;&#33410;&#28857;&#26159;&#29238;&#33410;&#28857;&#30340;&#24038;&#23376;&#33410;&#28857;, &#19979;&#19968;&#20010;&#32467;&#28857;&#21363;&#20026;&#29238;&#33410;&#28857;
+            if pNode.next and pNode.next.left == pNode:
+                pNext = pNode.next
+            # &#22914;&#26524;&#24403;&#21069;&#33410;&#28857;&#26377;&#29238;&#33410;&#28857;&#19988;&#24403;&#21069;&#33410;&#28857;&#26159;&#29238;&#33410;&#28857;&#30340;&#21491;&#23376;&#33410;&#28857;, &#37027;&#20040;&#21521;&#19978;&#36941;&#21382;
+            # &#24403;&#36941;&#21382;&#21040;&#24403;&#21069;&#33410;&#28857;&#20026;&#29238;&#33410;&#28857;&#30340;&#24038;&#23376;&#33410;&#28857;&#26102;, &#36755;&#20837;&#33410;&#28857;&#30340;&#19979;&#19968;&#20010;&#32467;&#28857;&#20026;&#24403;&#21069;&#33410;&#28857;&#30340;&#29238;&#33410;&#28857;
+            elif pNode.next and pNode.next.right == pNode:
+                pNode = pNode.next
+                while pNode.next and pNode.next.right == pNode:
+                    pNode = pNode.next
+                # &#36941;&#21382;&#32456;&#27490;&#26102;&#24403;&#21069;&#33410;&#28857;&#26377;&#29238;&#33410;&#28857;, &#35828;&#26126;&#24403;&#21069;&#33410;&#28857;&#26159;&#29238;&#33410;&#28857;&#30340;&#24038;&#23376;&#33410;&#28857;, &#36755;&#20837;&#33410;&#28857;&#30340;&#19979;&#19968;&#20010;&#32467;&#28857;&#20026;&#24403;&#21069;&#33410;&#28857;&#30340;&#29238;&#33410;&#28857;
+                # &#21453;&#20043;&#32456;&#27490;&#26102;&#24403;&#21069;&#33410;&#28857;&#27809;&#26377;&#29238;&#33410;&#28857;, &#35828;&#26126;&#24403;&#21069;&#33410;&#28857;&#22312;&#20301;&#20110;&#26681;&#33410;&#28857;&#30340;&#21491;&#23376;&#26641;, &#27809;&#26377;&#19979;&#19968;&#20010;&#32467;&#28857;
+                if pNode.next:
+                    pNext = pNode.next
         return pNext
diff --git a/Target Offer/&#23545;&#31216;&#30340;&#20108;&#21449;&#26641;.py b/Target Offer/&#23545;&#31216;&#30340;&#20108;&#21449;&#26641;.py
@@ -20,4 +20,71 @@ def selfIsSymmetrical(self, pRoot1, pRoot2):
         if pRoot1.val != pRoot2.val:
             return False
         return self.selfIsSymmetrical(pRoot1.left, pRoot2.right) and self.selfIsSymmetrical(pRoot1.right, pRoot2.left)
+# &#38750;&#36882;&#24402;&#23454;&#29616;&#21028;&#26029;&#20108;&#21449;&#26641;&#26159;&#21542;&#23545;&#31216;
+# &#21033;&#29992;&#21069;&#24207;&#36941;&#21382;
+class Solution2:
+    def isSymmetrical(self, pRoot):
+        preList = self.preOrder(pRoot)
+        mirrorList = self.mirrorPreOrder(pRoot)
+        if preList == mirrorList:
+            return True
+        return False
+
+    def preOrder(self, pRoot):
+        if pRoot == None:
+            return [None]
+        treeStack = []
+        output = []
+        pNode = pRoot
+        while pNode or len(treeStack) > 0:
+            while pNode:
+                treeStack.append(pNode)
+                output.append(pNode.val)
+                pNode = pNode.left
+                if not pNode:
+                    output.append(None)
+            if len(treeStack):
+                pNode = treeStack.pop()
+                pNode = pNode.right
+                if not pNode:
+                    output.append(None)
+        return output
+
+    def mirrorPreOrder(self, pRoot):
+        if pRoot == None:
+            return [None]
+        treeStack = []
+        output = []
+        pNode = pRoot
+        while pNode or len(treeStack) > 0:
+            while pNode:
+                treeStack.append(pNode)
+                output.append(pNode.val)
+                pNode = pNode.right
+                if not pNode:
+                    output.append(None)
+            if len(treeStack):
+                pNode = treeStack.pop()
+                pNode = pNode.left
+                if not pNode:
+                    output.append(None)
+        return output
+
+pNode1 = TreeNode(8)
+pNode2 = TreeNode(6)
+pNode3 = TreeNode(10)
+pNode4 = TreeNode(5)
+pNode5 = TreeNode(7)
+pNode6 = TreeNode(9)
+pNode7 = TreeNode(11)
+
+pNode1.left = pNode2
+pNode1.right = pNode3
+pNode2.left = pNode4
+pNode2.right = pNode5
+pNode3.left = pNode6
+pNode3.right = pNode7
 
+S = Solution2()
+result = S.isSymmetrical(pNode1)
+print(result)
