"""Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

 

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]"""
nums = [2, 3, 11, 7, 15]
target = 10000
def twoSum1(nums, target):
    result = []
    for i in range(len(nums)-1):
        for j in range(i+1, len(nums)):
            if nums[i] + nums[j] == target:
                result = [i, j]
                return result

re = twoSum1(nums, target)
print(re)

def twoSum2(nums, target):
    result = []
    m = {}
    for i in range(len(nums)):
        if target - nums[i] in m:
            result = [m[target - nums[i]], i]
            return result 
        else:
            m[nums[i]] = i
    
    return [-1,-1]

a = twoSum2(nums, target)
print(a)