import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) {
if(input.length < k){
ArrayList<Integer> arr = new ArrayList<>();
return arr;
}
ArrayList<Integer> result = sort(input, k);
return result;
}
public ArrayList<Integer> sort(int[] arr, int k){
int temp ;
ArrayList<Integer> arrayList = new ArrayList<>();
for(int i = 0;i < arr.length; i++){
for(int j = i+1;j < arr.length; j++){
if(arr[i] > arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[i] = arr[j];
arr[j] = temp;
}
}
if(k > i){
int a = arr[i];
arrayList.add(a);
}else{
break;
}
}
return arrayList;
}
}
通过冒泡排序对给定数组进行前k个排序,然后输出