Find the subscript with and as the target from the array

Problem description

Given an array of integers nums And an integer target value target, Please find... In the array And is the target value target the Two Integers , And return their array subscripts .

You can assume that each input corresponds to only one answer . however , The same element in the array cannot be repeated in the answer .

Solution ：

This is the choice hash Table improves the method of finding the corresponding number , because hashmap The search complexity of is O(1).
Why record this , It's because I just came into contact go, There are two ways of writing that are more meaningful .

package main

import "fmt"
func twoSum(nums []int, target int) []int {
    
	hashTable := map[int]int{
    }
	for i, x := range nums {
    

		if p, ok := hashTable[target-x]; ok {
    
			fmt.Println(p,i)
			return []int{
    p, i}

		}
		//hashmap in key Is the value ,value Subscript the corresponding array 
		// Find the desired subscript by value 
		hashTable[x] = i
	}
	return nil
}
func main()  {
    
	nums := []int{
    1,2,3,4,5,10}
	target :=  11
	twoSum(nums,target)
}

for i, x := range nums {
    
		// Detect whether there is a key value in the mapping ：target-x In mapping hashTable Of map Is there any value in ？
		if p, ok := hashTable[target-x]; ok {
    
			return []int{
    p, i}

		}