Leetcode 001: Two Sum

#coding:utf-8

'''
    leetcode 001 question
    author: xuyaowen time: 2018-04-02 
    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.
'''
class Solution(object):
    def twoSum(self, nums, target):
        pair = dict(zip(nums,range(len(nums))))
        for i in range(len(nums)):
            p =  target - nums[i]
            if  p in nums:
                if p == target/2 and pair[p] == i:
                    continue
                return [i, pair[p]] #所有的解对应当下的坐标
# 1319 ms 时间效率很慢
# 解决方法，两遍哈希表
ans =  Solution()
print(ans.twoSum([3, 3], 6))

#coding:utf-8

'''
    leetcode 001 question
    author: xuyaowen time: 2018-04-02 
    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.
'''
class Solution(object):
    def twoSum(self, nums, target):
        seen = {}
        for i, n in enumerate(nums):
            o = target-n
            if o in seen:
                return [seen[o], i]
            seen[n] = i
# 40ms
# 一遍哈希表
ans =  Solution()
print(ans.twoSum([2, 7, 11, 15], 9))