Commit 62490bc

committed

Create two_sum.py

1 parent 91dd1e4 commit 62490bcCopy full SHA for 62490bc

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+# Given an array of integers nums and an integer target, return the indices i and j such that nums[i] + nums[j] == target and i != j.`
	`2`	`+# You may assume that every input has exactly one pair of indices i and j that satisfy the condition.`
	`3`	`+# Return the answer with the smaller index first.`
	`4`	`+# Example :`
	`5`	`+# Input:`
	`6`	`+# nums = [3,4,5,6], target = 7`
	`7`	`+# Output: [0,1]`
	`8`	`+`
	`9`	`+from typing import List`
	`10`	`+`
	`11`	`+class Solution:`
	`12`	`+ def twoSum(self, nums: List[int], target: int) -> List[int]:`
	`13`	`+`
	`14`	`+ hashmap = {}`
	`15`	`+`
	`16`	`+ for i , n in enumerate(nums):`
	`17`	`+ diff = target - n`
	`18`	`+ if diff in hashmap:`
	`19`	`+ return [hashmap[diff],i]`
	`20`	`+ else:`
	`21`	`+ hashmap[n] = i`
	`22`	`+`
	`23`	`+print(Solution().twoSum([3,4,5,6],7))`

Comments

(0)