[Code Formatter & Update Leaderboard] by 🤖

asdf2014 · asdf2014 · commit 496d8122f815 · 2025-07-17T09:06:00.000Z
diff --git a/.idea/dictionaries/yuzhouwan.xml b/.idea/dictionaries/yuzhouwan.xml
diff --git a/Codes/BlitheLou/LeetCode/001_two_sum.py b/Codes/BlitheLou/LeetCode/001_two_sum.py
@@ -6,13 +6,14 @@
 你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。
 
 示例:
-	给定 nums = [2, 7, 11, 15], target = 9
-	因为 nums[0] + nums[1] = 2 + 7 = 9
-	所以返回 [0, 1]
+        给定 nums = [2, 7, 11, 15], target = 9
+        因为 nums[0] + nums[1] = 2 + 7 = 9
+        所以返回 [0, 1]
 
 来源：力扣（LeetCode）
 链接：https://leetcode-cn.com/problems/two-sum
 """
+
 """
 方式一：
 	两层循环分别遍历 nums，在内层循环内，判断两数和是否为 target。
diff --git a/Codes/BlitheLou/LeetCode/002_add_two_numbers.py b/Codes/BlitheLou/LeetCode/002_add_two_numbers.py
@@ -14,6 +14,7 @@
 来源：力扣（LeetCode）
 链接：https://leetcode-cn.com/problems/add-two-numbers
 """
+
 """
 方式一：
 由于 输入：(2 -> 4 -> 3) 表示整数 342.
diff --git a/Codes/BlitheLou/LeetCode/other_code/206_reverse_linked_list.py b/Codes/BlitheLou/LeetCode/other_code/206_reverse_linked_list.py
@@ -5,6 +5,7 @@
     输入: 1->2->3->4->5->NULL
     输出: 5->4->3->2->1->NULL
 """
+
 """
 想法：
 很容易想到，可以遍历单链表，依次取节点值，再以头插法放到另一个新链表中。
diff --git a/Codes/GinRyan/LeetCode/Python-3-Solves/1_sum_to_target.py b/Codes/GinRyan/LeetCode/Python-3-Solves/1_sum_to_target.py
@@ -10,6 +10,7 @@
 因为 nums[0] + nums[1] = 2 + 7 = 9
 所以返回 [0, 1]
 """
+
 """
 解题思考1：
 
diff --git a/Codes/GinRyan/LeetCode/Python-3-Solves/3_longest_substring_without_repeating_characters.py b/Codes/GinRyan/LeetCode/Python-3-Solves/3_longest_substring_without_repeating_characters.py
@@ -4,7 +4,7 @@
 示例 1:
 
 输入: "abcabcbb"
-输出: 3 
+输出: 3
 解释: 因为无重复字符的最长子串是 "abc"，所以其长度为 3。
 
 示例 2:
diff --git a/Codes/GinRyan/LeetCode/Python-3-Solves/5_longest_palindromic_substring.py b/Codes/GinRyan/LeetCode/Python-3-Solves/5_longest_palindromic_substring.py
@@ -13,6 +13,7 @@
 输出: "bb"
 
 """
+
 """
 题解: 
 本题可以用一种中央扩散法, 最差情况O(N^2)
@@ -46,7 +47,11 @@ def longestPalindrome(self, s: str) -> str:
                 print("--可用最大邻域: " + str(naborspace + 1))
                 for n in range(naborspace + 1):
                     print(
-                        "--邻域内比对: 第" + str(n + 1) + "个邻域值，共" + str(naborspace + 1) + "个"
+                        "--邻域内比对: 第"
+                        + str(n + 1)
+                        + "个邻域值，共"
+                        + str(naborspace + 1)
+                        + "个"
                     )
                     if left >= 0 and right < total:
                         sLeft = s[left]
diff --git a/Codes/GinRyan/LeetCode/Python-3-Solves/8_string_to_integer_atoi.py b/Codes/GinRyan/LeetCode/Python-3-Solves/8_string_to_integer_atoi.py
@@ -44,7 +44,7 @@
 
 输入: "-91283472332"
 输出: -2147483648
-解释: 数字 "-91283472332" 超过 32 位有符号整数范围。 
+解释: 数字 "-91283472332" 超过 32 位有符号整数范围。
      因此返回 INT_MIN (−2^31) 。
 
 来源：力扣（LeetCode）
diff --git a/Codes/GinRyan/LeetCode/Python-3-Solves/9_palindrome_number.py b/Codes/GinRyan/LeetCode/Python-3-Solves/9_palindrome_number.py
@@ -22,6 +22,7 @@
 
 你能不将整数转为字符串来解决这个问题吗？
 """
+
 """
 解题思路：
 
diff --git a/Codes/gracekoo/47_permutations-ii.py b/Codes/gracekoo/47_permutations-ii.py
@@ -12,7 +12,9 @@ def backtrack(nums, num):
                 output_list.append(num)
                 return
             for i in range(len(nums)):
-                if i > 0 and nums[i] == nums[i - 1]:  # 每当进入新的构成，先考虑该构成的首字符是否和上一个一样。
+                if (
+                    i > 0 and nums[i] == nums[i - 1]
+                ):  # 每当进入新的构成，先考虑该构成的首字符是否和上一个一样。
                     continue
                 backtrack(nums[:i] + nums[i + 1 :], num + [nums[i]])
 
diff --git a/Codes/gracekoo/68_text-justification.py b/Codes/gracekoo/68_text-justification.py
@@ -26,8 +26,12 @@ def fullJustify(self, words: List[str], maxWidth: int) -> List[str]:
                         word_list[0] + " " * (maxWidth - current_chars_number)
                     )
                 else:
-                    blank_space_number = maxWidth - current_chars_number  # 当前的空格数量
-                    if blank_space_number % (current_words_number - 1) == 0:  # 空格可以平均分配
+                    blank_space_number = (
+                        maxWidth - current_chars_number
+                    )  # 当前的空格数量
+                    if (
+                        blank_space_number % (current_words_number - 1) == 0
+                    ):  # 空格可以平均分配
                         result.append(
                             (
                                 " " * (blank_space_number // (current_words_number - 1))
diff --git a/Codes/gracekoo/interview_4.py b/Codes/gracekoo/interview_4.py
@@ -26,7 +26,9 @@ def buildTree(self, preorder, inorder):
         left_in_inorder = inorder[:root_index]
         right_in_inorder = inorder[root_index + 1 :]
         # 在前序列表中的左右子树
-        left_in_preorder = preorder[1 : root_index + 1]  # 左子树数量就是root_index的个数
+        left_in_preorder = preorder[
+            1 : root_index + 1
+        ]  # 左子树数量就是root_index的个数
         right_in_preorder = preorder[root_index + 1 :]
 
         # 递归创建子树
diff --git a/Codes/gracekoo/interview_49.py b/Codes/gracekoo/interview_49.py
@@ -10,7 +10,12 @@ def strToInt(self, str: str) -> int:
         if not str:
             return 0
         # string = str.split()[0]  # 不使用split，strip等方法可以将空间复杂度降到O(1)
-        result, i, sign, len_str = 0, 0, 1, len(str)  # 结果，开始的索引，正负号，str的长度
+        result, i, sign, len_str = (
+            0,
+            0,
+            1,
+            len(str),
+        )  # 结果，开始的索引，正负号，str的长度
         int_max, int_min, boundary = 2**31 - 1, -(2**31), 2**31 // 10
 
         # 去除空格
diff --git a/Codes/gracekoo/interview_63.py b/Codes/gracekoo/interview_63.py
@@ -12,7 +12,9 @@ def __init__(self):
         initialize your data structure here.
         """
         self.A = []  # 大顶堆，存放较小的元素
-        self.B = []  # 小顶堆，存放较大的元素，使得B的最小的元素也比A中最大的元素大，保证数据流保持有序
+        self.B = (
+            []
+        )  # 小顶堆，存放较大的元素，使得B的最小的元素也比A中最大的元素大，保证数据流保持有序
 
     def addNum(self, num: int) -> None:
         # 数据流长度为奇数时，需向A中插入元素：先向B中插入num，再将B的堆顶元素插入至A，保证B比A大
diff --git a/Codes/stardrewer/138_copy-list-with-random-pointer/solve.py b/Codes/stardrewer/138_copy-list-with-random-pointer/solve.py
@@ -4,7 +4,7 @@
 @Author  : Star
 @Email   : zsdzzydos@gmail.com
 @Time    : 2019年09月10日 15:36
-@Desc    : 
+@Desc    :
 """
 
 
diff --git a/Codes/stardrewer/30_substring-with-concatenation-of-all-words/solve.py b/Codes/stardrewer/30_substring-with-concatenation-of-all-words/solve.py
@@ -6,7 +6,9 @@ def findSubstring(self, s: str, words: List[str]) -> List[int]:
         res = []
         if len("".join(words)) > len(s):
             return res
-        if words == ["ab", "ba"] * 100:  # 这里确实有点力不从心....面对这么长的串....取巧了
+        if (
+            words == ["ab", "ba"] * 100
+        ):  # 这里确实有点力不从心....面对这么长的串....取巧了
             return []
         if s and words and "".join(words) == s:
             return [0]
diff --git a/Picker/random_picker.py b/Picker/random_picker.py
@@ -69,5 +69,8 @@ def flush_readme(readme_file, url, date_comment, local):
     False,
 )
 flush_readme(
-    "README-zh.md", "https://leetcode-cn.com/problems/", "🤖：最近一次更新时间为 `%s`。\n", True
+    "README-zh.md",
+    "https://leetcode-cn.com/problems/",
+    "🤖：最近一次更新时间为 `%s`。\n",
+    True,
 )
diff --git a/README-zh.md b/README-zh.md
@@ -86,12 +86,12 @@ bash -c "$(curl -L https://raw.githubusercontent.com/asdf2014/algorithm/master/f
 | :--: | :----------------: |
 | **[shengyaqingfeng](https://github.com/asdf2014/algorithm/tree/master/Codes/shengyaqingfeng)** | 2023-08-28 00:05:35 |
 | **[asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014)** | 2023-08-13 20:12:58 |
-| **[gmywq392](https://github.com/asdf2014/algorithm/tree/master/Codes/gmywq392)** | 2023-02-20 00:23:14 |
-| [P_fzr](https://github.com/asdf2014/algorithm/tree/master/Codes/P_fzr) | 2023-02-20 00:23:14 |
+| **[GinRyan](https://github.com/asdf2014/algorithm/tree/master/Codes/GinRyan)** | 2023-02-20 00:23:14 |
 | [gracekoo](https://github.com/asdf2014/algorithm/tree/master/Codes/gracekoo) | 2023-02-20 00:23:14 |
-| [GinRyan](https://github.com/asdf2014/algorithm/tree/master/Codes/GinRyan) | 2023-02-20 00:23:14 |
-| [mrright2019](https://github.com/asdf2014/algorithm/tree/master/Codes/mrright2019) | 2023-02-20 00:23:14 |
+| [P_fzr](https://github.com/asdf2014/algorithm/tree/master/Codes/P_fzr) | 2023-02-20 00:23:14 |
 | [fengxuanmo](https://github.com/asdf2014/algorithm/tree/master/Codes/fengxuanmo) | 2023-02-20 00:23:14 |
+| [mrright2019](https://github.com/asdf2014/algorithm/tree/master/Codes/mrright2019) | 2023-02-20 00:23:14 |
+| [gmywq392](https://github.com/asdf2014/algorithm/tree/master/Codes/gmywq392) | 2023-02-20 00:23:14 |
 | [purebaba](https://github.com/asdf2014/algorithm/tree/master/Codes/purebaba) | 2022-08-30 17:21:56 |
 | [yore](https://github.com/asdf2014/algorithm/tree/master/Codes/yore) | 2022-07-20 10:31:02 |
 
diff --git a/README.md b/README.md
@@ -87,12 +87,12 @@ bash -c "$(curl -L https://raw.githubusercontent.com/asdf2014/algorithm/master/f
 | :--: | :----------------: |
 | **[shengyaqingfeng](https://github.com/asdf2014/algorithm/tree/master/Codes/shengyaqingfeng)** | 2023-08-27 16:05:35 |
 | **[asdf2014](https://github.com/asdf2014/algorithm/tree/master/Codes/asdf2014)** | 2023-08-13 12:12:58 |
-| **[gmywq392](https://github.com/asdf2014/algorithm/tree/master/Codes/gmywq392)** | 2023-02-19 16:23:14 |
-| [P_fzr](https://github.com/asdf2014/algorithm/tree/master/Codes/P_fzr) | 2023-02-19 16:23:14 |
+| **[GinRyan](https://github.com/asdf2014/algorithm/tree/master/Codes/GinRyan)** | 2023-02-19 16:23:14 |
 | [gracekoo](https://github.com/asdf2014/algorithm/tree/master/Codes/gracekoo) | 2023-02-19 16:23:14 |
-| [GinRyan](https://github.com/asdf2014/algorithm/tree/master/Codes/GinRyan) | 2023-02-19 16:23:14 |
-| [mrright2019](https://github.com/asdf2014/algorithm/tree/master/Codes/mrright2019) | 2023-02-19 16:23:14 |
+| [P_fzr](https://github.com/asdf2014/algorithm/tree/master/Codes/P_fzr) | 2023-02-19 16:23:14 |
 | [fengxuanmo](https://github.com/asdf2014/algorithm/tree/master/Codes/fengxuanmo) | 2023-02-19 16:23:14 |
+| [mrright2019](https://github.com/asdf2014/algorithm/tree/master/Codes/mrright2019) | 2023-02-19 16:23:14 |
+| [gmywq392](https://github.com/asdf2014/algorithm/tree/master/Codes/gmywq392) | 2023-02-19 16:23:14 |
 | [purebaba](https://github.com/asdf2014/algorithm/tree/master/Codes/purebaba) | 2022-08-30 09:21:56 |
 | [yore](https://github.com/asdf2014/algorithm/tree/master/Codes/yore) | 2022-07-20 02:31:02 |
 
