일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- medinum
- 모던 자바스크립티 Deep Dive
- toast-ui-editor
- Weekly Contest
- Biweekly Contest 79
- React Router dom v6
- 모던 자바스크립트 Deep Dive
- Vite
- 프로그래머스
- Medium
- LV. 2
- .env
- next.js
- React
- leetcode
- React Private Routes
- javascript
- 컴포넌트 최적화
- engines locking
- commitlint
- Sanity.io
- react-dom
- BFS
- 호이스팅
- React.memo
- eslintrc
- sql
- next-auth
- tailwindcss
- React Public Routes
- Today
- Total
목록BFS (2)
뚜벅
542. 01 Matrix Medium Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Input: mat = [[0,0,0],[0,1,0],[0,0,0]] Output: [[0,0,0],[0,1,0],[0,0,0]] Example 2: Input: mat = [[0,0,0],[0,1,0],[1,1,1]] Output: [[0,0,0],[0,1,0],[1,2,1]] Constraints: m == mat.length n == mat[i].length 1
1091. Shortest Path in Binary Matrix Medium Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that: All the visited cells of the path are 0. All the adjacent cells of the path are 8-..