Description
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].
My Answer
class Solution { func twoSum(_ nums: [Int], _ target: Int) -> [Int] { for index in 0..<nums.count { let num = nums[index]; for x in index + 1..<nums.count { let otherNum = nums[x] if num + otherNum == target { return [index, x] } } } return [] } }