answer accepted beats 46% of runtime
This commit is contained in:
parent
279f276493
commit
feb856028e
@ -4,6 +4,12 @@ def twoSum(nums, target):
|
||||
:type target: int
|
||||
:rtype: List[int]
|
||||
"""
|
||||
for i in range(len(nums)):
|
||||
for j in range(i+1, len(nums)):
|
||||
if nums[i] + nums[j] == target:
|
||||
#print(f'i is {nums[i]}, j is {nums[j]}')
|
||||
return [i,j]
|
||||
|
||||
|
||||
twoSum([2,7,11,15], 9)
|
||||
print(twoSum([2,7,11,15], 9))
|
||||
print(twoSum([3,2,4], 6))
|
||||
Loading…
Reference in New Issue
Block a user