Skip to content

Commit fa8a2f3

Browse files
authored
Merge pull request #397 from hyejjun/main
2 parents d027001 + 7b9f698 commit fa8a2f3

File tree

2 files changed

+51
-0
lines changed

2 files changed

+51
-0
lines changed

climbing-stairs/hyejjun.js

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
/**
2+
* @param {number} n
3+
* @return {number}
4+
*/
5+
var climbStairs = function (n) {
6+
if (n <= 2) return n;
7+
8+
let first = 1;
9+
let second = 2;
10+
11+
for (let i = 3; i <= n; i++) {
12+
let third = first + second;
13+
first = second;
14+
second = third;
15+
}
16+
17+
return second;
18+
};
19+
20+
console.log(climbStairs(2));
21+
console.log(climbStairs(3));
22+
console.log(climbStairs(4));
23+
console.log(climbStairs(5));
24+
25+
/*
26+
시간 복잡도: O(n)
27+
공간 복잡도: O(1)
28+
*/

two-sum/hyejjun.js

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
/**
2+
* @param {number[]} nums
3+
* @param {number} target
4+
* @return {number[]}
5+
*/
6+
var twoSum = function (nums, target) {
7+
for (let i = 0; i < nums.length; i++) {
8+
for (let j = i + 1; j < nums.length; j++) {
9+
if (nums[i] + nums[j] === target) {
10+
return [i, j];
11+
}
12+
}
13+
}
14+
};
15+
16+
console.log(twoSum([2, 7, 11, 15], 9));
17+
console.log(twoSum([3, 2, 4], 6));
18+
console.log(twoSum([3, 3], 6));
19+
20+
/*
21+
시간 복잡도: O(n^2)
22+
공간 복잡도: O(1)
23+
*/

0 commit comments

Comments
 (0)