TwoSum

link : https://leetcode.com/problems/two-sum/description/

backgroud knowlege

• use go build-in struture whitch that like map or slice

about problem

Give you two array of Integer and give you an integar target, you need to return a indices of the numbers such that they add up to target.

Example

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

Code

func twoSum(nums []int, target int) []int {
    temp_map := make(map[int]int)
    for i:=0;i<len(nums);i++{
        remainValue := target - nums[i] 
        value,ok :=  temp_map[remainValue]
        if ok {
            return []int{i,value}
        }
        temp_map[nums[i]] = i
    }
    return []int{0,0}
}