linlin994395
diff --git a/‎.idea/workspace.xml‎
Lines changed: 50 additions & 51 deletions b/‎.idea/workspace.xml‎
Lines changed: 50 additions & 51 deletions
diff --git a/‎Target Offer/二叉树中和为某一值的路径.py‎
Lines changed: 8 additions & 16 deletions b/‎Target Offer/二叉树中和为某一值的路径.py‎
Lines changed: 8 additions & 16 deletions
diff --git a/‎Target Offer/复杂链表的复制.py‎
Lines changed: 9 additions & 12 deletions b/‎Target Offer/复杂链表的复制.py‎
Lines changed: 9 additions & 12 deletions
diff --git a/‎Target Offer/字符串的排列.py‎ ‎Target Offer/字符串的排列和组合.py‎Target Offer/字符串的排列.py renamed to Target Offer/字符串的排列和组合.py b/‎Target Offer/字符串的排列.py‎ ‎Target Offer/字符串的排列和组合.py‎Target Offer/字符串的排列.py renamed to Target Offer/字符串的排列和组合.py
@@ -11,9 +11,7 @@ def __init__(self, x):
 class Solution:
     # 返回二维列表，内部每个列表表示找到的路径
     def FindPath(self, root, expectNumber):
-        if root == None:
-            return []
-        if root.val > expectNumber:
+        if root == None or root.val > expectNumber:
             return []
         elif root.val == expectNumber:
             if root.left or root.right:
@@ -24,21 +22,15 @@ def FindPath(self, root, expectNumber):
         stack = []
         if root.left:
             stackLeft = self.FindPath(root.left, expectNumber-root.val)
-            if stackLeft:
-                for i in stackLeft:
-                    i.insert(0, root.val)
-                    stack.append(i)
+            for i in stackLeft:
+                i.insert(0, root.val)
+                stack.append(i)
         if root.right:
             stackRight = self.FindPath(root.right, expectNumber-root.val)
-            if stackRight:
-                for i in stackRight:
-                    i.insert(0, root.val)
-                    stack.append(i)
-
-        if stack:
-            return stack
-        else:
-            return []
+            for i in stackRight:
+                i.insert(0, root.val)
+                stack.append(i)
+        return stack
 
 pNode1 = TreeNode(10)
 pNode2 = TreeNode(5)
 
@@ -20,35 +20,32 @@ def Clone(self, pHead):
     # 复制原始链表的每个结点, 将复制的结点链接在其原始结点的后面
     def CloneNodes(self, pHead):
         pNode = pHead
-        while pNode != None:
+        while pNode:
             pCloned = RandomListNode(0)
             pCloned.label = pNode.label
             pCloned.next = pNode.next
-            pCloned.random = None
+            # pCloned.random = None         #不需要写这句话, 因为创建新的结点的时候,random自动指向None
 
             pNode.next = pCloned
-
             pNode = pCloned.next
+
     # 将复制后的链表中的复制结点的random指针链接到被复制结点random指针的后一个结点
     def ConnectRandomNodes(self, pHead):
         pNode = pHead
-        while pNode != None:
+        while pNode:
             pCloned = pNode.next
             if pNode.random != None:
                 pCloned.random = pNode.random.next
             pNode = pCloned.next
+
     # 拆分链表, 将原始链表的结点组成新的链表, 复制结点组成复制后的链表
     def ReconnectNodes(self, pHead):
         pNode = pHead
-        pClonedHead = None
-        pClonedNode = None
-
-        if pNode != None:
-            pClonedHead = pClonedNode = pNode.next
-            pNode.next = pClonedHead.next
-            pNode = pNode.next
+        pClonedHead = pClonedNode = pNode.next
+        pNode.next = pClonedHead.next
+        pNode = pNode.next
 
-        while pNode != None:
+        while pNode:
             pClonedNode.next = pNode.next
             pClonedNode = pClonedNode.next
             pNode.next = pClonedNode.next