Commit df245d6

committed

TwoSum

1 parent 7ba618a commit df245d6Copy full SHA for df245d6

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+'''Leetcode - https://leetcode.com/problems/two-sum/ '''`
	`2`	`+'''`
	`3`	`+Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.`
	`4`	`+`
	`5`	`+You may assume that each input would have exactly one solution, and you may not use the same element twice.`
	`6`	`+`
	`7`	`+You can return the answer in any order.`
	`8`	`+`
	`9`	`+Input: nums = [2,7,11,15], target = 9`
	`10`	`+Output: [0,1]`
	`11`	`+'''`
	`12`	`+`
	`13`	`+# Solution1`
	`14`	`+def twoSum(nums, target):`
	`15`	`+ for i in range(len(nums)):`
	`16`	`+ for j in range(i+1, len(nums)):`
	`17`	`+ if nums[i] + nums[j] == target:`
	`18`	`+ return [i, j]`
	`19`	`+# T:O(N^2)`
	`20`	`+# S:O(1)`
	`21`	`+`
	`22`	`+# Solution2`
	`23`	`+def twoSum(nums, target):`
	`24`	`+ dict = {}`
	`25`	`+ for i in range(len(nums)):`
	`26`	`+ diff = target - nums[i]`
	`27`	`+ if diff in dict:`
	`28`	`+ return [dict[diff], i]`
	`29`	`+ dict[nums[i]] = i`
	`30`	`+`
	`31`	`+# T: O(N)`
	`32`	`+# S: O(N)`
	`33`	`+`
	`34`	`+`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,6 +29,7 @@ Check the notes for the explaination - [Notes](https://stingy-shallot-4ea.notion`
`29`	`29`	`- [x] [Counting Bits](Dynamic-Programming/338-Counting-Bits.py)`
`30`	`30`
`31`	`31`	`- [x] [Arrays](Arrays)`
	`32`	`+ - [x] [Two Sum](Arrays/001-twosum.py)`
`32`	`33`	`- [x] [Contains Duplicate](Arrays/217-Contains-duplicate.py)`
`33`	`34`	`- [x] [Product Of Array Except Self](Arrays/238-product-of-array-except-self.py)`
`34`	`35`

Comments

(0)