g0601_0700.s0658_find_k_closest_elements.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0601_0700.s0658_find_k_closest_elements;
// #Medium #Array #Sorting #Binary_Search #Two_Pointers #Heap_Priority_Queue #Binary_Search_II_Day_2
// #2022_03_21_Time_3_ms_(99.20%)_Space_44.1_MB_(88.25%)
import java.util.ArrayList;
import java.util.List;
public class Solution {
public List findClosestElements(int[] arr, int k, int x) {
int left = 0;
int right = arr.length - k;
List answer = new ArrayList<>();
while (left < right) {
int mid = left + (right - left) / 2;
if (x - arr[mid] > arr[mid + k] - x) {
left = mid + 1;
} else {
right = mid;
}
}
for (int i = left; i < left + k; i++) {
answer.add(arr[i]);
}
return answer;
}
}