GoLang Solution For LeetCode Problem: Find K Closest Elements
Solving Find K Closest Elements in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: [1,2,3,4,5], k=4, x=3 Output: [1,2,3,4]
Input: [1,2,3,4,5], k=4, x=-1 Output: [1,2,3,4]
- 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 10^4
- Absolute value of elements in the array and x will not exceed 10^4
See the full details of the problem Find K Closest Elements at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go