华为机试HJ58

HJ58 输入n个整数，输出其中最小的k个

描述

输入n个整数，找出其中最小的k个整数并按升序输出

本题有多组输入样例

法一

import java.util.Scanner;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            int num = in.nextInt();
            int k = in.nextInt();
            int[] arr = new int[num];
            for (int i = 0 ; i < num ; i++) {
                arr[i] = in.nextInt();
            }

            Arrays.sort(arr);
            for (int j = 0 ; j < k ; j++) {
                System.out.print(arr[j] + " ");
            }
        }
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

法二

import java.util.*;
//使用冒泡排序
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < n; i++) {
            array[i] = sc.nextInt();
        }
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array.length - i - 1; j++) {
                if (array[j] > array[j + 1]) {
                    int temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
        for (int i = 0; i < k; i++) {
            System.out.print(array[i] + " ");
        }
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25