LeetCode 1. The sum of two numbers - js

Solution 1, two layers of for loop

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
function twoSum(nums, target) {
    const res = new Array();
    for (let i = 0; i < nums.length-1; i++) {
        const element1 = nums[i];
        for (let j = i+1; j < nums.length; j++) {
            const element2 = nums[j];
            if(element1+element2===target){
                res[0] = i
                res[1] = j
                break
            }
        }
        
    }
    return res
}

Solution 2, map solution

The answer given by the system is the better answer

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
function twoSum(nums, target) {
    const map = new Map();
    for (let i = 0; i < nums.length; i++) {
        const res = target - nums[i]
        if(map.has(res)){
            return [map.get(res), i]
        }
        map.set(nums[i], i)
        
    }
}