refactor 658

fishercoder1534 · fishercoder1534 · commit 38f160d3f192 · 2020-07-18T06:49:12.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_658.java b/src/main/java/com/fishercoder/solutions/_658.java
@@ -3,27 +3,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 658. Find K Closest Elements
- *
- * 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=3
- Output: [1,2,3,4]
-
- Example 2:
- Input: [1,2,3,4,5], k=4, x=-1
- Output: [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
- */
 public class _658 {
     public static class Solution1 {
         public List<Integer> findClosestElements(List<Integer> arr, int k, int x) {
