mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
49 lines
1.1 KiB
Python
49 lines
1.1 KiB
Python
"""
|
|
Given an array of integers, return indices of the two numbers such that they add up to
|
|
a specific target.
|
|
|
|
You may assume that each input would have exactly one solution, and you may not use the
|
|
same element twice.
|
|
|
|
Example:
|
|
Given nums = [2, 7, 11, 15], target = 9,
|
|
|
|
Because nums[0] + nums[1] = 2 + 7 = 9,
|
|
return [0, 1].
|
|
"""
|
|
|
|
from __future__ import annotations
|
|
|
|
|
|
def two_sum(nums: list[int], target: int) -> list[int]:
|
|
"""
|
|
>>> two_sum([2, 7, 11, 15], 9)
|
|
[0, 1]
|
|
>>> two_sum([15, 2, 11, 7], 13)
|
|
[1, 2]
|
|
>>> two_sum([2, 7, 11, 15], 17)
|
|
[0, 3]
|
|
>>> two_sum([7, 15, 11, 2], 18)
|
|
[0, 2]
|
|
>>> two_sum([2, 7, 11, 15], 26)
|
|
[2, 3]
|
|
>>> two_sum([2, 7, 11, 15], 8)
|
|
[]
|
|
>>> two_sum([3 * i for i in range(10)], 19)
|
|
[]
|
|
"""
|
|
chk_map: dict[int, int] = {}
|
|
for index, val in enumerate(nums):
|
|
compl = target - val
|
|
if compl in chk_map:
|
|
return [chk_map[compl], index]
|
|
chk_map[val] = index
|
|
return []
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|
|
print(f"{two_sum([2, 7, 11, 15], 9) = }")
|