链接
来源:牛客网
[编程题]n个数里最小的k个
找出n个数里最小的k个
输入描述:
每个测试输入包含空格分割的n+1个整数,最后一个整数为k值,n
不超过100。
输出描述:
输出n个整数里最小的k个数。升序输出
示例
输入
3 9 6 8 -10 7 -11 19 30 12 23 5
输出
-11 -10 3 6 7
解题思路:
只要将得到的数组排序好然后输出前k个最小的元素就可以了,所以这个题就是靠排序的知识,这里放出两种代码:
第一种借助Arrays.sort()方法解决问题;
import java.util.Arrays;
import java.util.Scanner;
public class FindKthMiniNumber {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
String str = in.nextLine();
String[] strs = str.split(" ");
int len = strs.length;
int[] arr = new int[len-1];
for (int i = 0; i < arr.length; i++) {
arr[i] = Integer.valueOf(strs[i]);
}
int k = Integer.valueOf(strs[len-1]);
Arrays.sort(arr);
for (int i = 0; i < k; i++) {
System.out.print(arr[i]+" ");
}
}
}
}
第二种使用快排的思想
import java.util.*;
public class FindKthMiniNumber {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
String str = sc.nextLine();
String[] s = str.split(" ");
int[] num = new int[s.length - 1];
for (int i = 0; i < s.length - 1; i++) {
num[i] = Integer.parseInt(s[i]);
}
int k = Integer.parseInt(s[s.length - 1]);
int start = 0;
int end = num.length - 1;
int index = qSort(num, start, end);
while (index != k) {
if (index > k) {
end = index - 1;
index = qSort(num, start, end);
} else {
start = index + 1;
index = qSort(num, start, end);
}
}
Arrays.sort(num, 0, k);
for (int i = 0; i < k; i++) {
System.out.print(i == k - 1 ? num[i] : num[i] + " ");
}
}
}
public static int qSort(int[] num, int start, int end) {
int dig = num[start];
while (start < end) {
while (start < end && num[end] >= dig) end--;
num[start] = num[end];
while (start < end && num[start] < dig) start++;
num[end] = num[start];
}
num[start] = dig;
return start;
}
}