| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
| 31 |
Tags
- join
- level4
- import re
- lv4
- Stack
- counter
- 파이썬
- Level2
- coding test
- 코딩테스트
- Growth hacking
- 코테
- coding
- hackerrank
- programmers
- Queue
- python
- 조합
- LeetCode
- AARRR
- sql
- mysql
- 완전탐색
- 코딩
- cte
- lambda
- 프로그래머스
- time complexity
- itertools
- tableau
Archives
- Today
- Total
목록extendleft (1)
ror_coding
[Python] Stack, Queue (collections) (deque)
from collections import dequeStack (스택)Queue (큐) from collections import dequeq = deque([1,2,3], maxlen = 5) # 크기 고정.# 추가.q.append(4) # [1,2,3,4]q.appendleft(0) # [0,1,2,3,4]# 제거 ( = 쓰면 제거된 값을 반환)q.pop() # [0,1,2,3]q.popleft() # [1,2,3]# 확장q.extend([4,5]) # [1,2,3] => [1,2,3,4,5]q.extendleft([4,5]) # [1,2,3] => [5,4,1,2,3]# 회전q.rotate(1) # [1,2,3] => [3,1,2]
Coding Test/Python
2024. 12. 2. 16:04