algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-23 01:10:06 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format python codes with black. (#453)

Browse Source
This commit is contained in:
Yudong Jin
2023-04-09 05:05:35 +08:00
committed by GitHub
parent 1c8b7ef559
commit 5ddcb60825
45 changed files with 656 additions and 456 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/python/chapter_computational_complexity/leetcode_two_sum.py
View File

@ -4,8 +4,9 @@ Created Time: 2022-11-25
Author: Krahets (krahets@163.com)
"""
def two_sum_brute_force(nums: list[int], target: int) -> list[int]:
""" 方法一：暴力枚举 """
"""方法一：暴力枚举"""
# 两层循环，时间复杂度 O(n^2)
for i in range(len(nums) - 1):
for j in range(i + 1, len(nums)):
@ -13,8 +14,9 @@ def two_sum_brute_force(nums: list[int], target: int) -> list[int]:
return [i, j]
return []
def two_sum_hash_table(nums: list[int], target: int) -> list[int]:
""" 方法二：辅助哈希表 """
"""方法二：辅助哈希表"""
# 辅助哈希表，空间复杂度 O(n)
dic = {}
# 单层循环，时间复杂度 O(n)
@ -26,11 +28,11 @@ def two_sum_hash_table(nums: list[int], target: int) -> list[int]:
""" Driver Code """
if __name__ == '__main__':
if __name__ == "__main__":
# ======= Test Case =======
nums = [2,7,11,15]
nums = [2, 7, 11, 15]
target = 9
# ====== Driver Code ======
# 方法一
res: list[int] = two_sum_brute_force(nums, target)