标签：
题目:
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.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
链接：https://leetcode.com/problems/two-sum/
一刷
python
def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ existing_data = {} for index, num in enumerate(nums): lookup_value = target - num if lookup_value in existing_data: return existing_data[lookup_value], index existing_data[num] = index
swift
func twoSum(nums: [Int], _ target: Int) -> [Int] { var valueIndex = [Int: Int]() for (index, value) in nums.enumerate() { var pairValue: Int = target - value if let pairIndex = valueIndex[pairValue] { return [pairIndex, index] } valueIndex[value] = index } return [-1, -1] }
标签：
原文地址：http://www.cnblogs.com/panini/p/5544179.html
