FilesExpand file tree

 master

/

1. Two Sum.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

18 lines (17 loc) · 590 Bytes

 master

/

1. Two Sum.py

Copy path

Top

File metadata and controls

• Code
• Blame

18 lines (17 loc) · 590 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

'''

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.

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,

return [0, 1].

'''

class Solution():

def twoSum(self, nums, target):

hashdict = {}

for i, item in enumerate(nums):

if (target - item) in hashdict:

return (hashdict[target - item], i)

hashdict[item] = i

return (-1, -1)

s = Solution()

print(s.twoSum([2, 7, 11, 15], 9))