牛客-华为机考-HJ-入门-已完成

1、HJ7
//写出一个程序，接受一个正浮点数值，输出该数值的近似整数值。如果小数点后数值大于等于 0.5 ,向上取整；小于 0.5 ，则向下取整。

Scanner in = new Scanner(System.in);
double number = in.nextDouble();
System.out.println((int)(number + 0.5));

2、HJ9
//输入一个 int 型整数，按照从右向左的阅读顺序，返回一个不含重复数字的新的整数。
//保证输入的整数最后一位不是 0 。

public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    String s = in.nextLine();
    StringBuilder reverse = new StringBuilder(s).reverse();

    String toString = reverse.toString();

    StringBuilder stringBuilder = new StringBuilder();

    for (int i = 0; i < toString.length(); i++) {
        if (toString.indexOf(toString.charAt(i)) == i ) {
            stringBuilder.append(toString.charAt(i));
        }

    }
    System.out.println(stringBuilder.toString());
}

3、HJ46
//输入一个字符串和一个整数 k ，截取字符串的前k个字符并输出

public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    String s = in.nextLine();
    int i = in.nextInt();
    System.out.println(s.substring(0, i));
}

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

public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    while (in.hasNext()) {
        int n = in.nextInt();
        int k = in.nextInt();

        int [] re = new int[n];
        for (int i = 0; i < n; i++) {
            re[i] = in.nextInt();
        }
        Arrays.sort(re);
        for (int i = 0; i < k; i++) {
            System.out.print(re[i]+" ");
        }
    }
}

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

public static void main(String[] args) {
    // 1.输入
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] arr = new int[n];
    for (int i = 0; i < n; i++) {
        arr[i] = sc.nextInt();
    }
    int sortType = sc.nextInt();
    // 2.排序
    Arrays.sort(arr);
    for (int i = 0; i < arr.length; i++) {
        System.out.println(arr[i]);
    }
    // 3.输出结果
    if (sortType == 0) {
        for (int i : arr) {
            System.out.print(i + " ");
        }
    } else {
        for (int i = arr.length - 1; i >= 0; i--) {
            System.out.print(arr[i] + " ");
        }
    }
}