class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
pair = {} # value: idx
for i, num in enumerate(nums):
diff = target-num
if diff in pair: # i != pair[diff] 이 조건은 항상 참임
return [pair[diff], i] # 작은 index 가 앞으로.
pair[num] = i'LeetCode > Grind169' 카테고리의 다른 글
| 21. Merge Two Sorted Lists ☆ (0) | 2025.04.22 |
|---|---|
| 20. Valid Parentheses (0) | 2025.04.22 |
| [LinkedLists: Fast and Slow Pointers] 287. Find the Duplicate Number ★★★★★ (1) | 2025.04.06 |
| [Prefix Sums] 560. Subarray Sum Equals K ★★★★★ (0) | 2025.04.05 |
| 424. Longest Repeating Character Replacement ★★★★★ (0) | 2025.04.04 |