-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathtwo_sum.py
More file actions
21 lines (15 loc) · 901 Bytes
/
two_sum.py
File metadata and controls
21 lines (15 loc) · 901 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
"""
Write a function that takes an array of numbers (integers for the tests) and a target number. It should find two different items in the array that,
when added together, give the target value. The indices of these items should then be returned in a tuple / list (depending on your language)
like so: (index1, index2).
For the purposes of this kata, some tests may have multiple answers; any valid solutions will be accepted.
The input will always be valid (numbers will be an array of length 2 or greater, and all of the items will be numbers; target will always be the sum
of two different items from that array).
Based on: https://oj.leetcode.com/problems/two-sum/
twoSum [1, 2, 3] 4 === (0, 2)
"""
def two_sum(numbers, target):
for i in range(len(numbers) - 1):
for j in range(i + 1, len(numbers)):
if numbers[i] + numbers[j] == target:
return i, j