-
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/43163)
-
[문제 링크](https://www.acmicpc.net/problem/12851)
-
・来年までに茶色になる
・安定して30分以内に3完取れるようにする
・以下のアルゴリズムを身につける(できれば年度内)
1. 動的計画法
2. 累積和
3. BFSとDFS
4. bit全探索
-
Created by: @victorstewart
Source: https://github.com/RedisGraph/RedisGraph/issues/1089
Has anyone run any degrees of separation between 2 node benchmarks?
Say a graph of 1,000,000 nodes with arou…
-
```js
function TreeNode(val){
this.val = val;
this.left = null;
this.right = null;
}
function rightView(root){
// 请你实现
}
// => [1,4,3]
1 => 1
2 4 => 4
7 3 …
-
빙산 문제를 풀어주세요
https://www.acmicpc.net/problem/2573
-
有没有朋友研究过收藏集兑换的API?
我搜集到的:
全部列表:
https://api.bilibili.com/x/garb/card/subject/list?subject_id=42
基础信息:
https://api.bilibili.com/x/vas/dlc_act/act/basic?act_id={藏品id}
详细信息:
https://api.bilibili…
-
-
**BFS**
- 透過 BFS 一層一層往下找,並記錄 level
- 如果有找到 `node.left` 和 `node.right` 同時不存在的狀況,那麼就回傳 level
- result:`13.54%` (超慢 XD)
```javascript
var minDepth = function(root) {
if (!root) return 0
…
-
[게임 맵 최단거리](https://school.programmers.co.kr/learn/courses/30/lessons/1844)