Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
48 changes: 48 additions & 0 deletions leetcode3/곽현지/1552. Magnetic Force Between Two Balls
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@

import java.util.Arrays;

class Solution {
public int maxDistance(int[] position, int m) {
// 1. 바구니 위치 정렬
Arrays.sort(position);

// 2. 최소 거리의 탐색 범위 설정
int left = 1;
int right = position[position.length - 1] - position[0];
int answer = 0;

// 3. 이분 탐색
while (left <= right) {
int mid = left + (right - left) / 2;

// 4. mid 거리 이상으로 m개의 공을 배치할 수 있는지 확인
if (canPlace(position, m, mid)) {
answer = mid;
left = mid + 1;
} else {
right = mid - 1;
}
}

return answer;
}

// 공을 배치할 수 있는지 확인하는 함수
private boolean canPlace(int[] position, int m, int distance) {
int count = 1;
int lastPosition = position[0];

for (int i = 1; i < position.length; i++) {
if (position[i] - lastPosition >= distance) {
count++;
lastPosition = position[i];
}

if (count >= m) {
return true;
}
}

return false;
}
}
18 changes: 18 additions & 0 deletions leetcode3/곽현지/2498. Frog Jump II
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@

class Solution {
public int maxJump(int[] stones) {
// 1. 첫 번째와 두 번째 돌 사이의 거리
int answer = stones[1] - stones[0];

// 2. 한 칸씩 건너뛴 돌 사이의 거리 계산
for (int i = 2; i < stones.length; i++) {
int distance = stones[i] - stones[i - 1];

// 3. 가장 긴 점프 거리 저장
answer = Math.max(answer, distance);
}

// 4. 최소화할 수 있는 최대 점프 거리 반환
return answer;
}
}
Loading