/***
**冒泡排序取前面k个数。
*/
public static ArrayList<integer> GetLeastNumbers_Solution(int [] input, int k) {
ArrayList<integer>arrayList=new ArrayList<>(k);
int[] ints = Bubble_Sort(input);
for (int i = 0; i < k; i++) {
arrayList.add(ints[i]);
}
return arrayList;
}</integer></integer>
public static int[] Bubble_Sort(int[] input){ for (int i = input.length-1; i > 0; i--) { for (int j = 0; j < i; j++) { if (input[j]>input[j+1]){ int temp=0; temp=input[j]; input[j]=input[j+1]; input[j+1]=temp; } } } return input; }