forked from keon/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtwo_sum.py
39 lines (26 loc) · 890 Bytes
/
two_sum.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
"""
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)
"""
import unittest
def two_sum(array, target):
dic = {}
for i, num in enumerate(array):
if num in dic:
return dic[num], i
else:
dic[target - num] = i
return None
class TestSuite(unittest.TestCase):
def test_two_sum(self):
self.assertTupleEqual((0, 2), two_sum([2, 11, 7, 9], target=9))
self.assertTupleEqual((0, 3), two_sum([-3, 5, 2, 3, 8, -9], target=0))
self.assertIsNone(two_sum([-3, 5, 2, 3, 8, -9], target=6))
if __name__ == "__main__":
unittest.main()