Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6 Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6 Output: [0,1]
Constraints:
2 <= nums.length <= 104-109 <= nums[i] <= 109-109 <= target <= 109
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] ans = new int[2];
for(int i=0;i<nums.length;i++){
for(int j = i+1;j<nums.length;j++){
if(nums[i]+nums[j]==target){
ans[0]=i;
ans[1]=j;
}
}
}
return ans ;
}
}
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
# Create a dictionary to store the complement and its index
complement_map = {}
# Iterate through the list of numbers
for i, num in enumerate(nums):
# Calculate the complement
complement = target - num
# Check if the complement is already in the dictionary
if complement in complement_map:
# Return the indices of the complement and the current number
return [complement_map[complement], i]
# If complement not found, store the number and its index
complement_map[num] = i
© 2021 edSlash. All Rights Reserved.