From 3456cd63be924138ef2a9259436782cf5a1ac662 Mon Sep 17 00:00:00 2001 From: ImAlpha Date: Fri, 1 Sep 2023 21:36:51 -0700 Subject: [PATCH] solution accepted, beats 51% runtime --- NeetCodeRoadmap/Arrays_and_Hashing/167_Two_Sum_II.py | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/NeetCodeRoadmap/Arrays_and_Hashing/167_Two_Sum_II.py b/NeetCodeRoadmap/Arrays_and_Hashing/167_Two_Sum_II.py index 0e87bf7..8029abe 100644 --- a/NeetCodeRoadmap/Arrays_and_Hashing/167_Two_Sum_II.py +++ b/NeetCodeRoadmap/Arrays_and_Hashing/167_Two_Sum_II.py @@ -4,7 +4,10 @@ def twoSum(numbers, target): :type target: int :rtype: List[int] """ - last = len(numbers)-1 + if target >= 0: + last = len(numbers)-1 + else: + last = 1 # print( last) while last > 0: if numbers[last] > target and target > 0: @@ -15,7 +18,10 @@ def twoSum(numbers, target): for x in range(len(numbers)): if numbers[x] + numbers[last] == target: return [x+1, last+1] - last -= 1 + if target >= 0: + last -= 1 + else: + last += 1 print(twoSum([2,7,11,15], 9))