LeetCode 热题一之两数之和

for i in range(len(nums) - 1):    for j in range(i + 1, len(nums)):        if nums[i] + nums[j] == target:            return 

itemDict = {}for i in range(len(nums) - 1):    item = nums[i]    if itemDict.get(target - item) != None:        return [itmDict[target-item], i]    else:        itemDict[x] = 1

from typing import List

class Solution:    def twoSum(self, nums: List[int], target: int) -> List[int]:        itemDict = dict()        for i, item in enumerate(nums):            if itemDict.get(target - item) != None:                return [itemDict[target-item], i]            else:                itemDict[item] = i        return [-1, -1]

nums = [2,7,11,15]target = 9
result = Solution().twoSum(nums, target)print(result)

package main
import "fmt"
func twoSum(nums []int, target int) []int {    itemMap := map[int]int{}    for i, item := range nums {
        if originItem, exists := itemMap[target-item]; exists {            return []int{originItem, i}        } else {            itemMap[item] = i        }    }    return []int{}}
func main() {    nums := []int{2, 7, 11, 15}    target := 9    result := twoSum(nums, target)    fmt.Println(result)}