描述
给定一个数组,找出其中最小的K个数。例如数组元素是4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4。如果K>数组的长度,那么返回一个空的数组
示例1
输入:
[4,5,1,6,2,7,3,8],4
复制返回值:
[1,2,3,4]
public class Jz29_GetLeastNumbers_Solution {
@Test
public void test() {
int[] arr = {4, 5, 1, 6, 2, 7, 3, 8};
ArrayList<Integer> integers = GetLeastNumbers_Solution(arr, 1);
integers.forEach(a -> System.out.println(a));
}
public ArrayList<Integer> GetLeastNumbers_Solution(int[] input, int k) {
if (null == input || k > input.length) {
return new ArrayList<>();
}
for (int i = 1; i < k; i++) {
moveUp(input, i);
}
for (int i = k; i < input.length; i++) {
if (input[i] < input[0]) {
swap(input, 0, i);
moveDown(input, 0, k);
}
}
ArrayList ans = new ArrayList();
for (int i = 0; i < k; i++) {
ans.add(input[i]);
}
return ans;
}
public void moveDown(int[] arr, int pos, int k) {
while ((getLeft(pos) < k && arr[pos] < arr[getLeft(pos)]) || (getRight(pos) < k && arr[pos] < arr[getRight(pos)])) {
int child = getLeft(pos);
if (child + 1 <= k && arr[pos] < arr[child + 1] && arr[child] > arr[child + 1]) {
child++;
}
swap(arr, pos, child);
pos = child;
}
}
public void moveUp(int[] arr, int pos) {
while (arr[pos] > arr[getParent(pos)]) {
swap(arr, pos, getParent(pos));
pos = getParent(pos);
}
}
public void swap(int[] arr, int i, int j) {
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public int getParent(int pos) {
return (pos - 1) / 2;
}
public int getLeft(int pos) {
return 2 * pos + 1;
}
public int getRight(int pos) {
return 2 * pos + 2;
}
}