1import java.util.Arrays;
2
3class Solution {
4    public boolean canPlaceBalls(int[] position, int m, int minDist) {
5        int count = 1, lastPosition = position[0];
6        for (int i = 1; i < position.length; i++) {
7            if (position[i] - lastPosition >= minDist) {
8                count++;
9                lastPosition = position[i];
10                if (count >= m) {
11                    return true;
12                }
13            }
14        }
15        return false;
16    }
17    
18    public int maxDistance(int[] position, int m) {
19        Arrays.sort(position);
20        int left = 1, right = position[position.length - 1] - position[0];
21        int answer = 0;
22        while (left <= right) {
23            int mid = left + (right - left) / 2;
24            if (canPlaceBalls(position, m, mid)) {
25                answer = mid;
26                left = mid + 1;
27            } else {
28                right = mid - 1;
29            }
30        }
31        return answer;
32    }
33    
34    public static void main(String[] args) {
35        Solution sol = new Solution();
36        int[] position = {1, 2, 3, 4, 7};
37        int m = 3;
38        System.out.println(sol.maxDistance(position, m));
39    }
40}

1