GoLang Solution For LeetCode Problem: 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.
Given nums = [2, 7, 11, 15], target = 9, Because nums + nums = 2 + 7 = 9, return [0, 1].
See the full details of the problem Two Sum at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go