LeetCode 658. Find K Closest Elements 二分+双指针
摘要：
Given a sorted integer array `arr`, two integers `k` and `x`, return the `k` closest integers to `x` in the array. The result should also be sorted in 阅读全文
posted @ 2023-07-15 22:45 Blackzxy 阅读(4) 评论(0) 推荐(0) 编辑