Leetcode-658 Find K Closest Elements(找到 K 个最接近的元素)

class Solution
{
    public:
        int myBinarySearch(vector<int> arr,int target)
        {
            int le = 0;
            int ri = arr.size()-1;
            while(le <= ri)
            {
                int mid = (le+ri)/2;
                if(arr[mid] < target)
                    le = mid + 1;
                else if(arr[mid] > target)
                    ri = mid - 1;
                else
                    return mid;
            }
            return ri >= 0 ? ri : 0;
        }
        vector<int> findClosestElements(vector<int>& arr, int k, int x)
        {
            int oriIndex = myBinarySearch(arr,x);

            int le,ri;
            le = oriIndex;
            ri = oriIndex+1;
            int targetDiff = 0;
            
            
            vector<int> result;
            for(int i = targetDiff; targetDiff <= 100000; targetDiff ++)
            {
                while(le>=0 && abs(x-arr[le])==targetDiff)
                {
                    result.push_back(arr[le]);
                    k --;
                    le --;
                    
                    if(!k)
                        break;
                }
                if(!k)
                    break;

                while(ri<=arr.size()-1 && abs(x-arr[ri])==targetDiff)
                {
                    result.push_back(arr[ri]);
                    
                    k --;
                    ri ++;
                    if(!k)
                        break;
                }
                if(!k)
                    break;
            }
            
            sort(result.begin(),result.end());
            return result;
        }
};