summaryrefslogtreecommitdiff
path: root/1_array_hashing/two_sum.py
diff options
context:
space:
mode:
authorTheSiahxyz <164138827+TheSiahxyz@users.noreply.github.com>2024-09-24 04:50:56 +0900
committerTheSiahxyz <164138827+TheSiahxyz@users.noreply.github.com>2024-09-24 04:50:56 +0900
commitbfee35a21c60e062c0033ba4e7e032b86dcadf7c (patch)
tree2767d6dc45ff8b13a5b4cc6a790f5b38bd038268 /1_array_hashing/two_sum.py
parent8a77bd0cf92a726f186cd7490f7ed6a94b936fab (diff)
Init
Diffstat (limited to '1_array_hashing/two_sum.py')
-rw-r--r--1_array_hashing/two_sum.py8
1 files changed, 3 insertions, 5 deletions
diff --git a/1_array_hashing/two_sum.py b/1_array_hashing/two_sum.py
index 81b7278..676c32b 100644
--- a/1_array_hashing/two_sum.py
+++ b/1_array_hashing/two_sum.py
@@ -11,8 +11,7 @@ Return the answer with the smaller index first.
Example 1:
-Input:
-nums = [3,4,5,6], target = 7
+Input: nums = [3,4,5,6], target = 7
Output: [0,1]
@@ -44,9 +43,8 @@ class Solution:
def hashmap(self, nums: List[int], target: int) -> List[int]:
hm: dict = {}
for i, index in enumerate(nums):
- diff = target - index
- if diff in hm:
- return [hm[diff], i]
+ if target - index in hm:
+ return [hm[target - index], i]
hm[index] = i
return [-1, -1]