[LeetCode/Typescript] 1. Two Sum 정답

문제

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

Two Sum - LeetCode

 

정답

function twoSum(nums: number[], target: number): number[] {
    const result = [];
    for(let i = 0; i < nums.length; i++) {
        for(let j = i + 1; j < nums.length; j++) {
            const sum = nums[i] + nums[j]
            if(sum === target) {
                const firstIndex = nums.findIndex(ele => ele === nums[i]);
                result.push(firstIndex)
                result.push(nums.indexOf(nums[j], firstIndex + 1))
            }
        }
    }
    
    return result.sort();
};