python leetcode 1. Two Sum

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

class Solution(object):
    def twoSum_1(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        # 字典保存数字及位置
        dict = {}
        for i in range(len(nums)):
            if target - nums[i] not in dict:
                dict[nums[i]] = i
            else:
                return [dict[target - nums[i]], i]

    def twoSum_2(self, nums, target):
        for i in range(len(nums)):
            item = target - nums[i]
            if item in nums[i + 1:]:
                return [i, i + 1 + nums[i + 1:].index(item)]