https://app.codility.com/programmers/lessons/3-time_complexity/frog_jmp/
FrogJmp coding task - Learn to Code - Codility
Count minimal number of jumps from position X to Y.
app.codility.com
- X 현재 위치
- Y 도착 위치
- D 점프 길이
- X에서 Y로 갈 때, 점프 횟수 구하기
- O(1)
def solution(X, Y, D):
distance = Y-X
if distance % D ==0:
return distance//D
return int(distance//D)+1
'코딩테스트 > Codility' 카테고리의 다른 글
[codility] Lesson 5. Prefix Sums - PassingCars (0) | 2022.08.12 |
---|---|
[codility] Lesson 4. Counting Elements - PermCheck (0) | 2022.08.12 |
[codility] Lesson 4. Counting Elements - FrogRiverOne (0) | 2022.08.07 |
[codility] Lesson 3. Time Complexity - TapeEquilibrium (0) | 2022.08.06 |
[codility] Lesson 3. Time Complexity - PermMissingElem (0) | 2022.08.06 |