Commit 069b837

committed

1. Two Sum

1 parent 533e8b9 commit 069b837Copy full SHA for 069b837

File tree

+11

-0

lines changed

+11

-0

lines changed

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,6 +15,11 @@`
`15`	`15`	`# Time Complexity: O(n^2)`
`16`	`16`	`# Space Complexity: O(1)`
`17`	`17`
	`18`	`+'''`
	`19`	`+In the below approach, we used two for loops to iterate through the array and check if the sum of the two numbers is equal to the target.`
	`20`	`+If it is, we return the indices of the two numbers.`
	`21`	`+'''`
	`22`	`+`
`18`	`23`	`class Solution:`
`19`	`24`	`def twoSum(self, nums, target):`
`20`	`25`	`for i in range(len(nums)):`
`@@ -26,6 +31,12 @@ def twoSum(self, nums, target):`
`26`	`31`	`# Time Complexity: O(N)`
`27`	`32`	`# Space Complexity: O(N)`
`28`	`33`
	`34`	`+'''`
	`35`	`+This approach uses a dictionary to store the difference between the target and the current number as the key and the index as the value.`
	`36`	`+We then iterate through the array and check if the current number is in the dictionary.`
	`37`	`+If it is, we return the index of the current number and the value of the dictionary.`
	`38`	`+'''`
	`39`	`+`
`29`	`40`	`class Solution:`
`30`	`41`	`def twoSum(self, nums, target):`
`31`	`42`	`prev = {}`

Comments

(0)