일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 더현대서울 맛집
- 편스토랑 우승상품
- hackerrank
- SW Expert Academy
- Git
- 우분투
- 데이콘
- 프로그래머스
- PYTHON
- AI 경진대회
- gs25
- 맥북
- github
- Docker
- ChatGPT
- Real or Not? NLP with Disaster Tweets
- 캐치카페
- ubuntu
- 편스토랑
- programmers
- 코로나19
- 자연어처리
- 프로그래머스 파이썬
- dacon
- Kaggle
- 백준
- 파이썬
- Baekjoon
- 금융문자분석경진대회
- leetcode
- Today
- Total
목록
반응형
Stack and Queues (2)
솜씨좋은장씨
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bcTjim/btqC9yfMszk/J88RegXn3oTIsMeYhVOKT1/img.png)
A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic queu..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/eF2sVy/btqCQ45HKMs/ry6Ge8dzy9w1p09Wku9Yck/img.png)
A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bracket..