mirror of
https://github.com/krahets/hello-algo.git
synced 2026-06-15 22:57:48 +08:00
772183705e
* Add Russian docs site baseline * Add Russian localized codebase * Polish Russian code wording * Update ru code translation. * Update code translation and chapter covers. * Fix pythontutor extraction. * Add README and landing page. * placeholder of profiles * Use figures of English version * Remove chapter paperbook
43 lines
1.4 KiB
Python
43 lines
1.4 KiB
Python
"""
|
|
File: two_sum.py
|
|
Created Time: 2022-11-25
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
|
|
def two_sum_brute_force(nums: list[int], target: int) -> list[int]:
|
|
"""Метод 1: полный перебор"""
|
|
# Два вложенных цикла, временная сложность O(n^2)
|
|
for i in range(len(nums) - 1):
|
|
for j in range(i + 1, len(nums)):
|
|
if nums[i] + nums[j] == target:
|
|
return [i, j]
|
|
return []
|
|
|
|
|
|
def two_sum_hash_table(nums: list[int], target: int) -> list[int]:
|
|
"""Метод 2: вспомогательная хеш-таблица"""
|
|
# Вспомогательная хеш-таблица, пространственная сложность O(n)
|
|
dic = {}
|
|
# Один цикл, временная сложность O(n)
|
|
for i in range(len(nums)):
|
|
if target - nums[i] in dic:
|
|
return [dic[target - nums[i]], i]
|
|
dic[nums[i]] = i
|
|
return []
|
|
|
|
|
|
"""Driver Code"""
|
|
if __name__ == "__main__":
|
|
# ======= Test Case =======
|
|
nums = [2, 7, 11, 15]
|
|
target = 13
|
|
|
|
# ====== Основной код ======
|
|
# Метод 1
|
|
res: list[int] = two_sum_brute_force(nums, target)
|
|
print("Результат метода 1 res =", res)
|
|
# Метод 2
|
|
res: list[int] = two_sum_hash_table(nums, target)
|
|
print("Результат метода 2 res =", res)
|