| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- component
- Props
- c++
- Context
- array
- DP
- state
- event
- routes
- JSX
- 비트연산
- leetcode
- count
- priority_queue
- UE5
- bit
- css
- axios
- nodeJS
- Navigation
- BinaryTree
- server
- treenode
- React
- map
- MySQL
- route
- Callback
- node.js
- queue
- Today
- Total
목록queue (2)
우사미 코딩
1. 문제링크 https://leetcode.com/problems/course-schedule-ii/ Course Schedule II - LeetCode Can you solve this real interview question? Course Schedule II - There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take leetcode.com a과목의 선수과목이 b일 때 vector = {a, b};로 표시한다. ..
1. 문제링크 Rotting Oranges - LeetCode Can you solve this real interview question? Rotting Oranges - You are given an m x n grid where each cell can have one of three values: * 0 representing an empty cell, * 1 representing a fresh orange, or * 2 representing a rotten orange. Every minute, any leetcode.com 2. key point - queue를 사용하자 1) 상한 오렌지 q에 넣기 2) 오렌지는 자기 주변 4셀(상하좌우)만 썩게 할 수 있음 3) 상태가 1에서 2로 변경되..