commit

darrenzhang1007 · Aug 12, 2020 · 0a0df70 · 0a0df70
1 parent 2f06ab6
commit 0a0df70
Show file tree

Hide file tree

Showing 13 changed files with 6 additions and 5 deletions.
diff --git a/array/283_移动零/283_easy_移动零.py b/array/283_移动零/283_easy_移动零.py
@@ -40,6 +40,7 @@ def moveZeroes(self, nums):
         """
         if not nums:
             return 0
+
         """ O(N^2)
         for i in range(len(nums)):
             if nums[i] == 0 :
@@ -58,7 +59,7 @@ def moveZeroes(self, nums):
                 j += 1
         """
 
-        """ O(N)
+        """O(N)
         # 第一次遍历，j指针记录非零个数，只要是非0的统统赋值给nums[j]
         j = 0
         for i in range(len(nums)) :

diff --git a/...yList/从尾到头打印链表/printListFromTailToHead.md → ...yList/从尾到头打印链表/printListFromTailToHead.md b/...yList/从尾到头打印链表/printListFromTailToHead.md → ...yList/从尾到头打印链表/printListFromTailToHead.md
diff --git a/...yList/从尾到头打印链表/printListFromTailToHead.py → ...yList/从尾到头打印链表/printListFromTailToHead.py b/...yList/从尾到头打印链表/printListFromTailToHead.py → ...yList/从尾到头打印链表/printListFromTailToHead.py
diff --git a/ArrayList/从尾到头打印链表/从尾到头打印链表.jpg → array/ArrayList/从尾到头打印链表/从尾到头打印链表.jpg b/ArrayList/从尾到头打印链表/从尾到头打印链表.jpg → array/ArrayList/从尾到头打印链表/从尾到头打印链表.jpg
diff --git a/ArrayList/数组中只出现一次的数字/FindNumsAppearOnce.py → ...rayList/数组中只出现一次的数字/FindNumsAppearOnce.py b/ArrayList/数组中只出现一次的数字/FindNumsAppearOnce.py → ...rayList/数组中只出现一次的数字/FindNumsAppearOnce.py
diff --git a/ArrayList/翻转链表/ReverseList.md → array/ArrayList/翻转链表/ReverseList.md b/ArrayList/翻转链表/ReverseList.md → array/ArrayList/翻转链表/ReverseList.md
diff --git a/ArrayList/翻转链表/ReverseList.py → array/ArrayList/翻转链表/ReverseList.py b/ArrayList/翻转链表/ReverseList.py → array/ArrayList/翻转链表/ReverseList.py
diff --git a/ArrayList/翻转链表/反转链表.png → array/ArrayList/翻转链表/反转链表.png b/ArrayList/翻转链表/反转链表.png → array/ArrayList/翻转链表/反转链表.png
diff --git a/ArrayList/链表中倒数第k个结点/FindKthToTail.md → array/ArrayList/链表中倒数第k个结点/FindKthToTail.md b/ArrayList/链表中倒数第k个结点/FindKthToTail.md → array/ArrayList/链表中倒数第k个结点/FindKthToTail.md
diff --git a/ArrayList/链表中倒数第k个结点/FindKthToTail.py → array/ArrayList/链表中倒数第k个结点/FindKthToTail.py b/ArrayList/链表中倒数第k个结点/FindKthToTail.py → array/ArrayList/链表中倒数第k个结点/FindKthToTail.py
diff --git a/ArrayList/链表中倒数第k个结点/链表中倒数的第k个结点.png → array/ArrayList/链表中倒数第k个结点/链表中倒数的第k个结点.png b/ArrayList/链表中倒数第k个结点/链表中倒数的第k个结点.png → array/ArrayList/链表中倒数第k个结点/链表中倒数的第k个结点.png
diff --git a/linked-list/206_反转链表/206_easy_反转链表.py b/linked-list/206_反转链表/206_easy_反转链表.py
@@ -34,8 +34,8 @@
 
 class Solution:
     def reverseList(self, head: ListNode) -> ListNode:
-        leftNode = None;
-        midNode = head;
+        leftNode = None
+        midNode = head
         while midNode :
             rightNode = midNode.next
             midNode.next = leftNode

diff --git a/linked-list/25_K 个一组翻转链表/25_hard_k个一组翻转链表.py b/linked-list/25_K 个一组翻转链表/25_hard_k个一组翻转链表.py
@@ -47,6 +47,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def reverseKGroup(self, head: ListNode, k: int) -> ListNode:
         dummy = ListNode(-1)
@@ -76,7 +77,6 @@ def reverseKGroup(self, head: ListNode, k: int) -> ListNode:
         return dummy.next
 
 
-
-
+Solution().reverseKGroup([1,2,3,4,5], 2)     
 # @lc code=end