# 算法练习001-TwoSum

## LeetCode001-TwoSum

Posted by qingshan on March 3, 2019

• 示例： 数组 nums = [2, 7, 11, 15], 目标值 9, 因为 nums[0] + nums[1] = 2 + 7 = 9,
• 返回 [0, 1].

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
# coding=utf-8

"""
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].
"""

class Solution(object):
def twoSum(self, nums, target):
for index, value in enumerate(nums):
b = target - value
if b in nums:
return [index, nums.index(b)]

if __name__ == "__main__":
nums = [2, 7, 11, 15]
target = 18
s = Solution()
print(s.twoSum(nums, target))


==END==