일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- Nextjs
- Programmers
- background tab
- Next13
- React 18 Nextjs
- codingtest
- react
- hook
- React 고급 안내서
- background: url
- Nextjs React 18
- react hook
- RTK Query
- React18
- Babel
- Render Props
- React 고급안내서
- Javascript
- React API 참고서
- getUTCDate
- next13 head
- React 18
- background setInterval
- notFound()
- context
- background setttimeout
- 고급안내서
- CSS
- react-helmet
- React 공식문서
Archives
- Today
- Total
목록알고리즘/backjoon (1)
akjfal
[Backjoon] 5052번 전화번호 목록
import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Arrays; import java.util.Comparator; class Main { static class Node{ int n; int depth; boolean isLast = false; Node[] child; Node(int n, int depth){ this.n = n; this.depth = depth; child = new Node[10]; } void inputChild(Node n, int idx){ child[idx] = n; } void checkLast(){ this.isLast =..
알고리즘/backjoon
2021. 6. 24. 15:58