Develope/Algorithm

[TIL] Algorithm 1

JinDevT 2020. 5. 13. 21:25

1. 문제

2. 해결방안

const twoSum = (nums, target) => {
  let array = [];
  for(let i = 0; i < nums.length; i++) {
    for(let y = 0; y < nums.length; y++){
      if(nums[i] + nums[y] === target) {
        array.push(i , y);
        return array;
      } 
    }
  }
}
twoSum([4, 9, 11, 14], 13)