LeetCode

LeetCode - Two Sum 完整代码（python）

要求：

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.

源码：

#!/usr/bin/env pythonclass solution(object):        def two_sum(self,nums,target):                l = {}                for i in range(len(nums)):                        if nums[i] in l:                                return [l[nums[i]],i]                        else:                                l[target-nums[i]] = iif __name__ == "__main__":        ll = []        lll = []        while len(ll)<3:                a  = int(raw_input('nums:\n'))                ll.append(a)        b = int(raw_input('target:\n'))        c = solution()        lll = c.two_sum(ll,b)        print lll

测试方法：

先输入三个待匹配的数字，以enter键隔开，再输入一个目标数字，最后得出是否有两个相加的数字匹配。

举例如下：

$ ./two_sum.py nums:6nums:3nums:8target:14[0, 2]