Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 |
Tags
- Python
- mysql
- backend
- Linux
- 파이썬
- 딥러닝
- c
- 리눅스
- hackthissite
- 경제
- 웹해킹
- BOF
- hackerschool
- deep learning
- php
- Shellcode
- c++
- 인공지능
- Web
- BOF 원정대
- flask
- 챗GPT
- webhacking
- Javascript
- hacking
- ChatGPT
- 러닝 스칼라
- Scala
- 백엔드
- 러닝스칼라
Archives
- Today
- Total
jam 블로그
#1. Two Sum [Easy] [javascript] 본문
728x90
문제
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]
Explanation: 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 <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
- Only one valid answer exists.
Follow-up:
Can you come up with an algorithm that is less than
O(n2)
time complexity?
풀이
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
var twoSum = function(nums, target) {
const results = [];
let index = 0;
while(nums.length) {
const first = nums.shift();
index++;
const result = nums.findIndex((num) => (target - (num + first) === 0));
if(result > -1) {
results.push(index - 1);
results.push(result + index);
break;
}
}
return results;
};
'개발 및 관련 자료 > LeetCode' 카테고리의 다른 글
#3. Longest Substring Without Repeating Characters [Medium] [Javascript] (0) | 2022.04.14 |
---|---|
#2. Add Two Numbers [Medium][Javascript] (0) | 2022.04.03 |
Comments