FilesExpand file tree

 master

/

sample.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

28 lines (26 loc) · 983 Bytes

 master

/

sample.py

Copy path

Top

File metadata and controls

• Code
• Blame

28 lines (26 loc) · 983 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

19

20

21

22

23

24

25

26

27

28

#source: https://github.com/kamyu104/LeetCode/blob/master/Python/two-sum.py

# Given an array of integers, find two numbers such that

# they add up to a specific target number.

# The function twoSum should return indices of the two numbers such that

# they add up to the target,

# where index1 must be less than index2. Please note that

# your returned answers (both index1 and index2) are not zero-based.

# You may assume that each input would have exactly one solution.

#

# Input: numbers={2, 7, 11, 15}, target=9

# Output: index1=1, index2=2

#

class Solution(object):

def twoSum(self, nums, target):

"""

:type nums: List[int]

:type target: int

:rtype: List[int]

"""

lookup = {}

for i, num in enumerate (nums):

if target - num in lookup:

return (lookup[target-num]+1, i+1)

lookup[num] = i;

if __name__ == '__main__':

print ("index1 = %d, index2 = %d" % Solution().twoSum((2,7,11,15), 9))