LeetCode: 1. Two Sum

Problem: 1. Two Sum

Link: https://leetcode.com/problems/two-sum/

Difficulty: Easy

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

Solution: 

Language: Swift

Runtime: 40ms
Memory: 4.7MB