Two Sum || DSA || JavaScript || By Munisekhar Udavalapati-JS Tutorial-php.cn

Two Sum || DSA || JavaScript || By Munisekhar Udavalapati

Linda Hamilton

Release： 2024-11-02 15:59:30

Original

1058 people have browsed it

Two Sum || DSA || JavaScript || By Munisekhar Udavalapati

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]

Copy after login

Constraints:
2 <= nums.length <= 104
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.

Copy after login

O(n²)

var twoSum = function(nums, target) {
    for(let i=0;i<nums.length;i++){
        for(let j=i+1;j<nums.length;j++){
            if(nums[i]+nums[j]==target){
                return [i,j]
            }
        }
    }
};

Copy after login

Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

O(n)

var twoSum = function(nums, target) {
    let map=new Map();
    for(let i=0;i<nums.length;i++){
        let v1=nums[i];
        let v2=target-v1;
        if(map.has(v2)){
            return [i,map.get(v2)]
        }
        map.set(v1,i)
    }
};

Copy after login

The above is the detailed content of Two Sum || DSA || JavaScript || By Munisekhar Udavalapati. For more information, please follow other related articles on the PHP Chinese website!