1. 两数之和[简单]🍉

题目信息

问题解答

暴力解法

https://leetcode-cn.com/submissions/detail/117226955/

function twoSum(nums: number[], target: number): number[] {
    for(let i = 0; i < nums.length; i++) {
        const j = nums.findIndex(num => num === target - nums[i])
        if(j !== -1 && j !== i) {
            return [i, j]
        }
    }
    return []
};

map

https://leetcode-cn.com/problems/two-sum/submissions/

function twoSum(nums: number[], target: number): number[] {
    const map = new Map()
    for(let i = 0; i < nums.length; i++) {
        const diff = target - nums[i]
        const j = map.get(diff)
        if(j !== undefined) {
            return [i, j]
        } else {
            map.set(nums[i], i)
        }
    }
    return []
};