-
틀렸는데 왜 틀렸는지 진심 모르겠엄 ^^;;;;
deque 사용하라던디 그거 모르고 걍 리스트로 풀었음
```
import sys
input = sys.stdin.readline
N,K = map(int, input().split())
ppl = [i for i in range(1,N+1)] # 사람들 수열
answer = []
…
-
Consider to have a queue obtained by processing, one by one, the elements included in the list of the first exercise, i.e. `my_queue = deque(["Draco", "Harry", "Hermione", "Ron", "Severus"])`. Describ…
-
The original mockito in Java has that and it's very convenient; can this be implemented in python mockito as well?
I'm a beginner in python but AFAICS this can be implemented as such:
```python
…
fge updated
11 months ago
-
# 233-Week 01 学习总结
### 学习内容
- 数组、链表、跳表、栈、队列、双端队列、优先队列
- 阅读每个数据结构的 java 实现
- 做题 leetCode
### 牢记师傅的话
- 做题最大误区是只做一遍题
- 优化思想：升维即空间换时间
### [Week 01 学习笔记链接](https://mubu.com/doc/x1I3Q84PQ0)
##…
-
Should be pretty easy. We can loop through a list of URLs and run the check on each.
https://github.com/dequelabs/axe-core-npm/blob/develop/packages/playwright/README.md
-
### LeetCode Username
ParshwaJain12
### Problem Number, Title, and Link
https://leetcode.com/problems/design-circular-deque/description/
### Bug Category
Missing test case *(Incorrect/Inefficient…
-
### LeetCode Username
himanggarg
### Problem Number, Title, and Link
641. Design Circular Deque https://leetcode.com/problems/design-circular-deque/
### Bug Category
Missing test case *(Incorrect…
-
RRB trees can be used to implement highly efficient random access vectors supporting splitAt, concat, insertAt and removeAt functions. I had a primitive implementation but decided not to include it as…
-
So, I finally got the game to compile and run in Visual Studio, and it runs just fine until I try to shoot stuff. According to the debugger, the deque iterator is not incrementable. I haven't tested t…
-
leetcode: https://leetcode-cn.com/problems/sliding-window-maximum/