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 |
Tags
- 메서드
- iframe 태그
- 예제
- FFT
- FlowLayout
- BorderLayout
- 상속
- 사전학습
- 퍼셉트론
- Codility
- ObjectOutputStream
- Position
- 반응형 웹 프로젝트
- rnn
- FileWriter
- CSS
- html 프로젝트
- inline
- 미디어쿼리
- Database
- 반응형웹
- html 기초
- java
- g검정
- 푸리에 변환
- oracle
- 파이썬
- css 기초
- HTML
- GridLayout
Archives
- Today
- Total
목록FrogJmp (1)
도라에몽주머니
[Codility/Java] 문제 4. FrogJmp
Task A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its target. Write a function: class Solution { public int solution(int X, int Y, int D); } that, given three..
Algorithm
2022. 11. 22. 20:20