Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 클린코드
- 북클럽
- 노마드코더
- 윈도우10
- 안드로이드
- 사용자폴더
- Android
- 부스트코스
- listview
- Node.js
- CS50
- 지하철api
- 트렐로 삭제
- RecyclerView
- CardView
- 백준
- activity
- 데이터바인딩
- 알고리즘
- Windows10
- androidstudio
- BOJ
- java
- 노마드북클럽
- 선형레이아웃
- github
- 액티비티
- 부스트캠프
- 노개북
- codility
Archives
- Today
- Total
목록Algorithm (1)
Be Developer
...더보기 A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers representing the falling leaves. A[K] represents the position where one leaf falls at time K, measured in se..
Algorithm
2019. 4. 10. 10:46