658. Find K Closest Elements-白红宇

658. Find K Closest Elements

阅读量：7304 次

发布时间：2019-06-30

本文共 882 字，大约阅读时间需要 2 分钟。

Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are always preferred.

Example 1:

Input: [1,2,3,4,5], k=4, x=3Output: [1,2,3,4]

Example 2:

Input: [1,2,3,4,5], k=4, x=-1Output: [1,2,3,4]

Note:

The value k is positive and will always be smaller than the length of the sorted array.

Length of the given array is positive and will not exceed 104

Absolute value of elements in the array and x will not exceed 104

class Solution {public:    vector
     
       findClosestElements(vector
      
       & arr, int k, int x) {         int n = arr.size();         if(n

res; while(left

&arr,int x) { int left = 0,right=arr.size()-1; while(left

x) right = mid-1; else left = mid+1; } return left; }};

转载于:https://www.cnblogs.com/jxr041100/p/8041085.html