1 Star 1 Fork 2

程序源代码/TheAlgorithms-Python

Create your Gitee Account
Explore and code with more than 14 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
two_sum.py 739 Bytes
Copy Edit Raw Blame History
Alex Brown authored 2018-10-20 06:14 +08:00 . snake_case all the things
"""
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 print_function
def twoSum(nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
chk_map = {}
for index, val in enumerate(nums):
compl = target - val
if compl in chk_map:
indices = [chk_map[compl], index]
print(indices)
return [indices]
else:
chk_map[val] = index
return False
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Python
1
https://gitee.com/itcode-itcode/TheAlgorithms-Python.git
git@gitee.com:itcode-itcode/TheAlgorithms-Python.git
itcode-itcode
TheAlgorithms-Python
TheAlgorithms-Python
master

Search