| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 미앤아이
- LeetCode
- javascript
- 취미
- 눈알빠지겠네
- 코테
- 지쿠악스
- 프라모델
- 지리데칼
- 바질토마토뭐시기
- 가챠
- 맛집
- 제프딕슨
- 노노그램
- 블라인드박스
- 롱라이플
- 건담
- 건담헤드
- DIY
- 코딩테스트
- 유루건
- 밥무하마드
- 메탈퍼즐
- 30mf
- 포켓몬
- 우리시대의역설
- 발더스게이트
- 발더스모드
- 누룽지소금빵
- 게임
- Today
- Total
목록2025/12/29 (3)
.Zzumbong
난이도 [ 😊 ] Easy 문제 설명 You are given an array apple of size n and an array capacity of size m. There are n packs where the ith pack contains apple[i] apples. There are m boxes as well, and the ith box has a capacity of capacity[i] apples. Return the minimum number of boxes you need to select to redistribute these n packs of apples into boxes. Note that, apples from the same pack can be distribute..
난이도 [ 🤔 ] Medium 문제 설명 You are stacking blocks to form a pyramid. Each block has a color, which is represented by a single letter. Each row of blocks contains one less block than the row beneath it and is centered on top. To make the pyramid aesthetically pleasing, there are only specific triangular patterns that are allowed. A triangular pattern consists of a single block stacked on top of t..
난이도 [ 😊 ] Easy문제 설명Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise,return the number of negative numbers in grid.여기서 non-increasing order는 내림차순(값이 같거나 작아짐)을 의미함.그리고 이게 row-wise(가로)와 column-wise 모두에 적용된다는 것이 핵심.입출력 예Example 1:Input: grid = [[4,3,2,-1],[3,2,1,-1],[1,1,-1,-2],[-1,-1,-2,-3]]Output: 8Explanation: There are 8 negatives number in the mat..