알고리즘 1 - Two Sum

박진현·2021년 7월 10일
0

Q.

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]
Output: 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]

Constraints:

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

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

A.

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

Runtime: 176 ms, faster than 15.27% of JavaScript online submissions for Two Sum.
Memory Usage: 38.9 MB, less than 88.60% of JavaScript online submissions for Two Sum.

profile
👨🏻‍💻 호기심이 많고 에러를 좋아하는 프론트엔드 개발자 박진현 입니다.

0개의 댓글