• Home
• com.github.javadev
• leetcode-in-java
• 1.7
• source code
• Solution.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0601_0700.s0658_find_k_closest_elements.Solution Maven / Gradle / Ivy

package g0601_0700.s0658_find_k_closest_elements;

// #Medium #Array #Sorting #Binary_Search #Two_Pointers #Heap_Priority_Queue

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;
    }
}