Leecode python小刷 打卡

1：

"""

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].

"""
def solve_ways(arrays,res):
    dic=dict()
    for k,v in enumerate(arrays):
        s = res-v
        if s in dic:
            print [k,dic[s]]
        else:
            dic[v]=k

solve_ways([1,2,3,6],7)