Skip to content

Commit 8eda2da

Browse files
authored
[alphaorderly] WEEK 02 Solutions (#2942)
* [alphaorderly] WEEK 02 Solutions * [alphaorderly] WEEK 02 Solutions * [alphaorderly] WEEK 02 Solutions
1 parent 87bdeec commit 8eda2da

5 files changed

Lines changed: 144 additions & 0 deletions

File tree

‎3sum/alphaorderly.ts‎

Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
2+
/**
3+
* 시간 복잡도: O(n²)
4+
* 공간 복잡도: O(n)
5+
*/
6+
function threeSum(nums: number[]): number[][] {
7+
nums.sort((a, b) => a - b);
8+
9+
let left = 0;
10+
let right = nums.length - 1;
11+
12+
const ans: number[][] = [];
13+
14+
while (left + 2 < nums.length) {
15+
if (nums[left] == nums[left - 1]) {
16+
left += 1;
17+
continue;
18+
}
19+
20+
right = nums.length - 1;
21+
22+
for (let mid = left + 1; mid < right;) {
23+
const sum = nums[left] + nums[mid] + nums[right];
24+
25+
if (sum == 0) {
26+
ans.push([nums[left], nums[mid], nums[right]]);
27+
28+
mid += 1;
29+
right -= 1;
30+
31+
while (mid < right && nums[mid] == nums[mid - 1]) {
32+
mid += 1;
33+
}
34+
} else if (sum < 0) {
35+
mid += 1;
36+
} else {
37+
right -= 1;
38+
}
39+
}
40+
41+
left += 1;
42+
}
43+
44+
return ans;
45+
}

‎climbing-stairs/alphaorderly.ts‎

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
/**
2+
* 시간 복잡도: O(n)
3+
* 공간 복잡도: O(1)
4+
*/
5+
function climbStairs(n: number): number {
6+
if(n <= 2) {
7+
return n
8+
}
9+
10+
11+
let a = 1;
12+
let b = 2;
13+
14+
for(let i = 1; i < n; i++) {
15+
let temp = a;
16+
a = b;
17+
b = a + temp;
18+
}
19+
20+
return a;
21+
};
Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
/**
2+
* 시간 복잡도: O(n)
3+
* 공간 복잡도: O(1)
4+
*/
5+
function productExceptSelf(nums: number[]): number[] {
6+
const ans = []
7+
ans[0] = 1
8+
9+
let acc = 1;
10+
for (let i = 1; i < nums.length;i += 1) {
11+
acc *= nums[i - 1];
12+
ans[i] = acc
13+
}
14+
15+
acc = 1;
16+
for (let i = nums.length - 2; i >= 0; i -= 1) {
17+
acc *= nums[i + 1];
18+
ans[i] *= acc
19+
}
20+
21+
return ans
22+
};

‎valid-anagram/alphaorderly.ts‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
/**
2+
* 시간 복잡도: O(n + m)
3+
* 공간 복잡도: O(k)
4+
*/
5+
function isAnagram(s: string, t: string): boolean {
6+
let s_map = new Map();
7+
let t_map = new Map();
8+
9+
for (let i = 0;i < s.length;i += 1) {
10+
if (s_map.has(s[i])) s_map.set(s[i], s_map.get(s[i]) + 1);
11+
else s_map.set(s[i], 1);
12+
}
13+
14+
for (let i = 0;i < t.length;i += 1) {
15+
if (t_map.has(t[i])) t_map.set(t[i], t_map.get(t[i]) + 1);
16+
else t_map.set(t[i], 1);
17+
}
18+
19+
for (const key of s_map.keys()) {
20+
if (!t_map.has(key)) return false;
21+
if (t_map.get(key) != s_map.get(key)) return false;
22+
}
23+
24+
for (const key of t_map.keys()) {
25+
if (!s_map.has(key)) return false;
26+
if (t_map.get(key) != s_map.get(key)) return false;
27+
}
28+
29+
return true;
30+
};
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* class TreeNode {
4+
* val: number
5+
* left: TreeNode | null
6+
* right: TreeNode | null
7+
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
8+
* this.val = (val===undefined ? 0 : val)
9+
* this.left = (left===undefined ? null : left)
10+
* this.right = (right===undefined ? null : right)
11+
* }
12+
* }
13+
*/
14+
15+
/**
16+
* 시간 복잡도: O(n)
17+
* 공간 복잡도: O(h), h는 트리의 높이 (최악의 경우 O(n))
18+
*/
19+
function isValidBST(root: TreeNode | null, min?: number, max?: number): boolean {
20+
if (root === null) return true;
21+
22+
if (min !== undefined && root.val <= min) return false
23+
if (max !== undefined && root.val >= max) return false
24+
25+
return isValidBST(root.left, min, root.val) && isValidBST(root.right, root.val, max)
26+
};

0 commit comments

Comments
 (0)