leetcode658+有序數組找出距離數字x最近的k個數字

時間 2021-01-15

原文原文鏈接

https://leetcode.com/problems/find-k-closest-elements/description/ class Solution { public: vector<int> findClosestElements(vector<int>& arr, int k, int x) { vector<int> res = arr;