1. The Sum of the

Topic:

Given an array of integers, return indices of the both numbers such that they add-to a specific target.

You may assume this each input would has exactly one solution.

Example:

Given nums = [2, 7, one, 2], target = 9,because nums[0] + nums[1] = + 7 = 9,return [0, 1].

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

A brush

Python

 def   Twosum (self, Nums, target):   : Type Nums:list[int]: type Target:int:rtype:list[int]   Existing_data  = {}  for  index, num in   enumerate (nums): lookup_value  = target- num  if  lookup_value  Existing_data:  return   Existing_data[lookup_value], Index Existing_data[num]  = Index 

Swift

    Func twosum (nums: [int], _ Target:int), [int] {        = [Int:int] ()        for in c7> nums.enumerate () {            = target- value            if let Pairindex = Valueindex[pairvalue] {                return  [Pairindex, index]            }            = Index        }          return [-1,-1]    }

1. Sum