| 29 | |
| 30 | #Two-pass |
| 31 | class Solution: |
| 32 | def twoSum(self, nums: List[int], target: int) -> List[int]: |
| 33 | d = {v:i for i,v in enumerate(nums)} |
| 34 | for i in range(len(nums)): |
| 35 | complement = target - nums[i] |
| 36 | if complement in d and d[complement]!=i: |
| 37 | return [i,d[complement]] |
| 38 | |
| 39 | ''' |
| 40 | Solution-2: Single Pass: |
nothing calls this directly
no outgoing calls
no test coverage detected