Breaking News: Grepper is joining You.com. Read the official announcement!

Problem Statement: Given a sorted number array and two integers ‘K’ and ‘X’, find ‘K’ closest numbers to ‘X’ in the array. Return the numbers in the sorted order. ‘X’ is not necessarily present in the array.

akileus answered on May 21, 2022 Popularity 2/10 Helpfulness 1/10

answer Problem Statement: Given a sorted number array and two integers ‘K’ and ‘X’, find ‘K’ closest numbers to ‘X’ in the array. Return the numbers in the sorted order. ‘X’ is not necessarily present in the array.

Problem Statement: Given a sorted number array and two integers ‘K’ and ‘X’, find ‘K’ closest numbers to ‘X’ in the array. Return the numbers in the sorted order. ‘X’ is not necessarily present in the array.

Comment

def find_closest_elements(arr, K, X):
    for i in range(len(arr)):
        if arr[i] >= X:
            break
    if i == 0:
        return arr[:K]
    if i + K - 1 >= len(arr):
        return arr[-K:]
    left = i - 1
    right = i + K - 1
    while K != 0:
        if abs(arr[left] - X) <= abs(arr[right] - X):
            left -= 1
            K -= 1
        else:
            right += 1
            K -= 1
    return arr[left + 1:right]

arr = [1, 2, 3, 4, 5]
find_closest_elements(arr, K = 4, X = 3)

Popularity 2/10 Helpfulness 1/10 Language whatever

Source: blog.askjarvis.io

Tags: closest find numbers return whatever

Link to this answer
Share Copy Link