刷题的日常[Leetcode]——1）Two Sum

题目描述：

从一个List里找出相加等于target的两个数，返回这两个数的索引（输入保证存在唯一解）

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        used={}
        for i in range(0,len(nums)):
        	chazhi=target-nums[i]
        	if chazhi in used:
        		return [used[chazhi],i]
        	used[nums[i]]=i
if __name__=="__main__":
	sol=Solution()
	nums=[2,2,4,3,8]
	res=sol.twoSum(nums,4)
	for i in range(0,len(res)):
		print res[i],