Permalink
Switch branches/tags
Nothing to show
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
36 lines (27 sloc) 780 Bytes
//
// TwoSum.swift
// LeetCode.swift
//
// Created by 叶帆 on 2017/10/9.
//
/**
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].
*/
import Foundation
class Solution {
func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
var dictionary = [Int: Int]()
for i in 0..<nums.count {
if let item = dictionary[target - nums[i]] {
return [item, i]
}
dictionary[nums[i]] = i
}
return []
}
}