1. Two Sum

26 Mar 1. Two Sum

1. Two Sum

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:
def twoSum(self, nums: List[int], target: int) -> List[int]:for i in range(len(nums)):
for j in range(i+1,len(nums) ):
tmp = nums[i] + nums[j]
if(tmp == target):
returnList =[]
returnList.append(i)
returnList.append(j)
return returnList